6,844 research outputs found
On building 4-critical plane and projective plane multiwheels from odd wheels
We build unbounded classes of plane and projective plane multiwheels that are
4-critical that are received summing odd wheels as edge sums modulo two. These
classes can be considered as ascending from single common graph that can be
received as edge sum modulo two of the octahedron graph O and the minimal wheel
W3. All graphs of these classes belong to 2n-2-edges-class of graphs, among
which are those that quadrangulate projective plane, i.e., graphs from
Gr\"otzsch class, received applying Mycielski's Construction to odd cycle.Comment: 10 page
Distance colouring without one cycle length
We consider distance colourings in graphs of maximum degree at most and
how excluding one fixed cycle length affects the number of colours
required as . For vertex-colouring and , if any two
distinct vertices connected by a path of at most edges are required to be
coloured differently, then a reduction by a logarithmic (in ) factor against
the trivial bound can be obtained by excluding an odd cycle length
if is odd or by excluding an even cycle length . For edge-colouring and , if any two distinct edges connected by
a path of fewer than edges are required to be coloured differently, then
excluding an even cycle length is sufficient for a logarithmic
factor reduction. For , neither of the above statements are possible
for other parity combinations of and . These results can be
considered extensions of results due to Johansson (1996) and Mahdian (2000),
and are related to open problems of Alon and Mohar (2002) and Kaiser and Kang
(2014).Comment: 14 pages, 1 figur
Constructing graphs with no immersion of large complete graphs
In 1989, Lescure and Meyniel proved, for , that every -chromatic
graph contains an immersion of , and in 2003 Abu-Khzam and Langston
conjectured that this holds for all . In 2010, DeVos, Kawarabayashi, Mohar,
and Okamura proved this conjecture for . In each proof, the
-chromatic assumption was not fully utilized, as the proofs only use the
fact that a -critical graph has minimum degree at least . DeVos,
Dvo\v{r}\'ak, Fox, McDonald, Mohar, and Scheide show the stronger conjecture
that a graph with minimum degree has an immersion of fails for
and with a finite number of examples for each value of ,
and small chromatic number relative to , but it is shown that a minimum
degree of does guarantee an immersion of .
In this paper we show that the stronger conjecture is false for
and give infinite families of examples with minimum degree and chromatic
number or that do not contain an immersion of . Our examples
can be up to -edge-connected. We show, using Haj\'os' Construction, that
there is an infinite class of non--colorable graphs that contain an
immersion of . We conclude with some open questions, and the conjecture
that a graph with minimum degree and more than
vertices of degree at least has an immersion of
Measurable versions of Vizing's theorem
We establish two versions of Vizing's theorem for Borel multi-graphs whose
vertex degrees and edge multiplicities are uniformly bounded by respectively
and . The ``approximate'' version states that, for any Borel
probability measure on the edge set and any , we can properly
colour all but -fraction of edges with colours in a
Borel way. The ``measurable'' version, which is our main result, states that
if, additionally, the measure is invariant, then there is a measurable proper
edge colouring of the whole edge set with at most colours
Topological lower bounds for the chromatic number: A hierarchy
This paper is a study of ``topological'' lower bounds for the chromatic
number of a graph. Such a lower bound was first introduced by Lov\'asz in 1978,
in his famous proof of the \emph{Kneser conjecture} via Algebraic Topology.
This conjecture stated that the \emph{Kneser graph} \KG_{m,n}, the graph with
all -element subsets of as vertices and all pairs of
disjoint sets as edges, has chromatic number . Several other proofs
have since been published (by B\'ar\'any, Schrijver, Dolnikov, Sarkaria, Kriz,
Greene, and others), all of them based on some version of the Borsuk--Ulam
theorem, but otherwise quite different. Each can be extended to yield some
lower bound on the chromatic number of an arbitrary graph. (Indeed, we observe
that \emph{every} finite graph may be represented as a generalized Kneser
graph, to which the above bounds apply.)
We show that these bounds are almost linearly ordered by strength, the
strongest one being essentially Lov\'asz' original bound in terms of a
neighborhood complex. We also present and compare various definitions of a
\emph{box complex} of a graph (developing ideas of Alon, Frankl, and Lov\'asz
and of \kriz). A suitable box complex is equivalent to Lov\'asz' complex, but
the construction is simpler and functorial, mapping graphs with homomorphisms
to -spaces with -maps.Comment: 16 pages, 1 figure. Jahresbericht der DMV, to appea
- …