455 research outputs found
Problems in extremal graph theory
We consider a variety of problems in extremal graph and set theory.
The {\em chromatic number} of , , is the smallest integer
such that is -colorable.
The {\it square} of , written , is the supergraph of in which also
vertices within distance 2 of each other in are adjacent.
A graph is a {\it minor} of if
can be obtained from a subgraph of by contracting edges.
We show that the upper bound for
conjectured by Wegner (1977) for planar graphs
holds when is a -minor-free graph.
We also show that is equal to the bound
only when contains a complete graph of that order.
One of the central problems of extremal hypergraph theory is
finding the maximum number of edges in a hypergraph
that does not contain a specific forbidden structure.
We consider as a forbidden structure a fixed number of members
that have empty common intersection
as well as small union.
We obtain a sharp upper bound on the size of uniform hypergraphs
that do not contain this structure,
when the number of vertices is sufficiently large.
Our result is strong enough to imply the same sharp upper bound
for several other interesting forbidden structures
such as the so-called strong simplices and clusters.
The {\em -dimensional hypercube}, ,
is the graph whose vertex set is and
whose edge set consists of the vertex pairs
differing in exactly one coordinate.
The generalized Tur\'an problem asks for the maximum number
of edges in a subgraph of a graph that does not contain
a forbidden subgraph .
We consider the Tur\'an problem where is and
is a cycle of length with .
Confirming a conjecture of Erd{\H o}s (1984),
we show that the ratio of the size of such a subgraph of
over the number of edges of is ,
i.e. in the limit this ratio approaches 0
as approaches infinity
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
The strong chromatic index of 1-planar graphs
The chromatic index of a graph is the smallest for which
admits an edge -coloring such that any two adjacent edges have distinct
colors. The strong chromatic index of is the smallest such
that has a proper edge -coloring with the condition that any two edges
at distance at most 2 receive distinct colors. A graph is 1-planar if it can be
drawn in the plane so that each edge is crossed by at most one other edge.
In this paper, we show that every graph with maximum average degree
has . As a corollary, we
prove that every 1-planar graph with maximum degree has
, which improves a result, due to Bensmail et
al., which says that if
- β¦