Sciweavers

4298 search results - page 8 / 860
» Measurable chromatic numbers
Sort
View
APAL
2011
13 years 2 months ago
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
Benjamin D. Miller
DAM
2008
134views more  DAM 2008»
13 years 7 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
13 years 7 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter
JGT
2008
75views more  JGT 2008»
13 years 7 months ago
On two questions about circular choosability
Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a...
Serguei Norine
JGT
2010
117views more  JGT 2010»
13 years 5 months ago
An approximate version of Hadwiger's conjecture for claw-free graphs
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
Maria Chudnovsky, Alexandra Ovetsky Fradkin