32 research outputs found
Induced subgraphs of graphs with large chromatic number. XII. Distant stars
The Gyarfas-Sumner conjecture asserts that if H is a tree then every graph
with bounded clique number and very large chromatic number contains H as an
induced subgraph. This is still open, although it has been proved for a few
simple families of trees, including trees of radius two, some special trees of
radius three, and subdivided stars. These trees all have the property that
their vertices of degree more than two are clustered quite closely together. In
this paper, we prove the conjecture for two families of trees which do not have
this restriction. As special cases, these families contain all double-ended
brooms and two-legged caterpillars
A survey of -boundedness
If a graph has bounded clique number, and sufficiently large chromatic
number, what can we say about its induced subgraphs? Andr\'as Gy\'arf\'as made
a number of challenging conjectures about this in the early 1980's, which have
remained open until recently; but in the last few years there has been
substantial progress. This is a survey of where we are now
Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path
A graph G is H-free if it has no induced subgraph isomorphic to H. We prove
that a -free graph with clique number has chromatic number
at most . The best previous result was an exponential
upper bound , due to Esperet, Lemoine, Maffray, and Morel. A
polynomial bound would imply that the celebrated Erdos-Hajnal conjecture holds
for , which is the smallest open case. Thus there is great interest in
whether there is a polynomial bound for -free graphs, and our result is an
attempt to approach that
Polynomial -binding functions for -broom-free graphs
For any positive integer , a \emph{-broom} is a graph obtained from
by subdividing an edge once. In this paper, we show that, for
graphs without induced -brooms, we have ,
where and are the chromatic number and clique number of
, respectively. When , this answers a question of Schiermeyer and
Randerath. Moreover, for , we strengthen the bound on to
, confirming a conjecture of Sivaraman. For and
\{-broom, \}-free graphs, we improve the bound to
.Comment: 14 pages, 1 figur
Induced subgraphs of graphs with large chromatic number. XIII. New brooms
Gy\'arf\'as and Sumner independently conjectured that for every tree , the
class of graphs not containing as an induced subgraph is -bounded,
that is, the chromatic numbers of graphs in this class are bounded above by a
function of their clique numbers. This remains open for general trees , but
has been proved for some particular trees. For , let us say a broom of
length is a tree obtained from a -edge path with ends by adding
some number of leaves adjacent to , and we call its handle. A tree
obtained from brooms of lengths by identifying their handles is a
-multibroom. Kierstead and Penrice proved that every
-multibroom satisfies the Gy\'arf\'as-Sumner conjecture, and
Kierstead and Zhu proved the same for -multibrooms. In this paper
give a common generalization: we prove that every
-multibroom satisfies the Gy\'arf\'as-Sumner conjecture
On coloring digraphs with forbidden induced subgraphs
This thesis mainly focuses on the structural properties of digraphs with high dichromatic number. The dichromatic number of a digraph , denoted by \dichi(D), is designed to be the directed analog of the chromatic number of a graph , denoted by . The field of -boundedness studies the induced subgraphs that need to be present in a graph with high chromatic number. In this thesis, we study the equivalent of -boundedness but with dichromatic number instead. In particular, we study the induced subgraphs of digraphs with high dichromatic number from two different perspectives which we describe below.
First, we present results in the area of heroes. A digraph is a hero of a class of digraphs if there exists a constant such that every -free digraph has \dichi(D)\leq c. It is already known that when is the family of -free digraphs for some digraph , the existence of heroes that are not transitive tournaments implies that is the disjoint union of oriented stars. In this thesis, we narrow down the characterization of the digraphs which have heroes that are not transitive tournaments to the disjoint union of oriented stars of degree at most 4. Furthermore, we provide a big step towards the characterization of heroes in -free digraphs, where . We achieve the latter by developing mathematical tools for proving that a hero in -free digraphs is also a hero in -free digraphs.
Second, we present results in the area of \dichi-boundedness. In this area, we try to determine the classes of digraphs for which transitive tournaments are heroes. In particular, we ask whether, for a given class of digraphs , there exists a function such that, for every , \dichi(D)\leq f(k) whenever and is -free. We provide a comprehensive literature review of the subject and outline the -boundedness results that have an equivalent result in \dichi-boundedness. We conclude by generalizing a key lemma in the literature and using it to prove -free digraphs are \dichi-bounded, where and are small brooms whose orientations are related and have an additional particular property
Large structures in dense directed graphs
We answer questions in extremal combinatorics, for directed graphs. Specifically, we investigate which large tree-like directed graphs are contained in all dense directed graphs of large order. More precisely, let T be an oriented tree of order n; among others, we establish the following results.
(1) We obtain a sufficient condition which ensures every tournament of order n contains T, and show that almost every tree possesses this property.
(2) We prove that for all positive C, ɛ and sufficiently large n, every tournament of order (1+ɛ)n contains T if Δ(T)≤(log n)^C.
(3) We prove that for all positive Δ, ɛ and sufficiently large n, every directed graph G of order n and minimum semidegree (1/2+ɛ)n contains T if Δ(T)≤Δ.
(4) We obtain a sufficient condition which ensures that every directed graph G of order n with minimum semidegree at least (1/2+ɛ)n contains T, and show that almost every tree possesses this property.
(5) We extend our method in (4) to a class of tree-like spanning graphs which includes all orientations of Hamilton cycles and large subdivisions of any graph.
Result (1) confirms a conjecture of Bender and Wormald and settles a conjecture of Havet and Thomassé for almost every tree; (2) strengthens a result of Kühn, Mycroft and Osthus; (3) is a directed graph analogue of a classical result of Komlós, Sárközy and Szemerédi and is implied by (4) and (5) is of independent interest