2,358 research outputs found
On topological relaxations of chromatic conjectures
There are several famous unsolved conjectures about the chromatic number that
were relaxed and already proven to hold for the fractional chromatic number. We
discuss similar relaxations for the topological lower bound(s) of the chromatic
number. In particular, we prove that such a relaxed version is true for the
Behzad-Vizing conjecture and also discuss the conjectures of Hedetniemi and of
Hadwiger from this point of view. For the latter, a similar statement was
already proven in an earlier paper of the first author with G. Tardos, our main
concern here is that the so-called odd Hadwiger conjecture looks much more
difficult in this respect. We prove that the statement of the odd Hadwiger
conjecture holds for large enough Kneser graphs and Schrijver graphs of any
fixed chromatic number
On prisms, M\"obius ladders and the cycle space of dense graphs
For a graph X, let f_0(X) denote its number of vertices, d(X) its minimum
degree and Z_1(X;Z/2) its cycle space in the standard graph-theoretical sense
(i.e. 1-dimensional cycle group in the sense of simplicial homology theory with
Z/2-coefficients). Call a graph Hamilton-generated if and only if the set of
all Hamilton circuits is a Z/2-generating system for Z_1(X;Z/2). The main
purpose of this paper is to prove the following: for every s > 0 there exists
n_0 such that for every graph X with f_0(X) >= n_0 vertices, (1) if d(X) >=
(1/2 + s) f_0(X) and f_0(X) is odd, then X is Hamilton-generated, (2) if d(X)
>= (1/2 + s) f_0(X) and f_0(X) is even, then the set of all Hamilton circuits
of X generates a codimension-one subspace of Z_1(X;Z/2), and the set of all
circuits of X having length either f_0(X)-1 or f_0(X) generates all of
Z_1(X;Z/2), (3) if d(X) >= (1/4 + s) f_0(X) and X is square bipartite, then X
is Hamilton-generated. All these degree-conditions are essentially
best-possible. The implications in (1) and (2) give an asymptotic affirmative
answer to a special case of an open conjecture which according to [European J.
Combin. 4 (1983), no. 3, p. 246] originates with A. Bondy.Comment: 33 pages; 5 figure
The number of independent sets in a graph with small maximum degree
Let be the number of independent sets in a graph . We show
that if has maximum degree at most then
(where is vertex degree, is the number of isolated
vertices in and is the complete bipartite graph with vertices
in one partition class and in the other), with equality if and only if each
connected component of is either a complete bipartite graph or a single
vertex. This bound (for all ) was conjectured by Kahn.
A corollary of our result is that if is -regular with then with
equality if and only if is a disjoint union of copies of
. This bound (for all ) was conjectured by Alon and Kahn and
recently proved for all by the second author, without the characterization
of the extreme cases.
Our proof involves a reduction to a finite search. For graphs with maximum
degree at most the search could be done by hand, but for the case of
maximum degree or , a computer is needed.Comment: Article will appear in {\em Graphs and Combinatorics
Triangle-Intersecting Families of Graphs
A family of graphs F is said to be triangle-intersecting if for any two
graphs G,H in F, the intersection of G and H contains a triangle. A conjecture
of Simonovits and Sos from 1976 states that the largest triangle-intersecting
families of graphs on a fixed set of n vertices are those obtained by fixing a
specific triangle and taking all graphs containing it, resulting in a family of
size (1/8) 2^{n choose 2}. We prove this conjecture and some generalizations
(for example, we prove that the same is true of odd-cycle-intersecting
families, and we obtain best possible bounds on the size of the family under
different, not necessarily uniform, measures). We also obtain stability
results, showing that almost-largest triangle-intersecting families have
approximately the same structure.Comment: 43 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
Neighborhood complexes and Kronecker double coverings
The neighborhood complex is a simplicial complex assigned to a graph
whose connectivity gives a lower bound for the chromatic number of . We
show that if the Kronecker double coverings of graphs are isomorphic, then
their neighborhood complexes are isomorphic. As an application, for integers
and greater than 2, we construct connected graphs and such that
but and . We also construct a
graph such that and the Kneser graph are not
isomorphic but their Kronecker double coverings are isomorphic.Comment: 10 pages. Some results concerning box complexes are deleted. to
appear in Osaka J. Mat
- …