12 research outputs found
Vertex colouring and forbidden subgraphs - a survey
There is a great variety of colouring concepts and results in the literature. Here our focus is to survey results on vertex colourings of graphs defined in terms of forbidden induced subgraph conditions
Extremal problems on counting combinatorial structures
The fast developing field of extremal combinatorics provides a diverse spectrum of powerful tools with many applications to economics, computer science, and optimization theory. In this thesis, we focus on counting and coloring problems in this field.
The complete balanced bipartite graph on vertices has \floor{n^2/4} edges. Since all of its subgraphs are triangle-free, the number of (labeled) triangle-free graphs on vertices is at least 2^{\floor{n^2/4}}. This was shown to be the correct order of magnitude in a celebrated paper Erd\H{o}s, Kleitman, and Rothschild from 1976, where the authors furthermore proved that almost all triangle-free graphs are bipartite. In Chapters 2 and 3 we study analogous problems for triangle-free graphs that are maximal with respect to inclusion.
In Chapter 2, we solve the following problem of Paul Erd\H{o}s: Determine or estimate the number of maximal triangle-free graphs on vertices. We show that the number of maximal triangle-free graphs is at most , which matches the previously known lower bound. Our proof uses among other tools the Ruzsa-Szemer\'{e}di Triangle Removal Lemma and recent results on characterizing of the structure of independent sets in hypergraphs. This is a joint work with J\'{o}zsef Balogh.
In Chapter 3, we investigate the structure of maximal triangle-free graphs. We prove that almost all maximal triangle-free graphs admit a vertex partition such that is a perfect matching and is an independent set. Our proof uses the Ruzsa-Szemer\'{e}di Removal Lemma, the Erd\H{o}s-Simonovits stability theorem, and recent results of Balogh-Morris-Samotij and Saxton-Thomason on the characterization of the structure of independent sets in hypergraphs. The proof also relies on a new bound on the number of maximal independent sets in triangle-free graphs with many vertex-disjoint 's, which is of independent interest. This is a joint work with J\'{o}zsef Balogh, Hong Liu, and Maryam Sharifzadeh.
In Chapte 4, we seek families in posets with the smallest number of comparable pairs. Given a poset , a family \F\subseteq P is \emph{centered} if it is obtained by `taking sets as close to the middle layer as possible'. A poset is said to have the \emph{centeredness property} if for any , among all families of size in , centered families contain the minimum number of comparable pairs. Kleitman showed that the Boolean lattice has the centeredness property. It was conjectured by Noel, Scott, and Sudakov, and by Balogh and Wagner, that the poset also has the centeredness property, provided is sufficiently large compared to . We show that this conjecture is false for all and investigate the range of for which it holds. Further, we improve a result of Noel, Scott, and Sudakov by showing that the poset of subspaces of has the centeredness property. Several open problems are also given. This is a joint result with J\'{o}zsef Balogh and Adam Zsolt Wagner.
In Chapter 5, we consider a graph coloring problem. Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some such that all -th power graphs are chromatic-choosable. We answer this question in the negative: we show that there is a positive constant such that for any there is a family of graphs with unbounded and . We also provide an upper bound, . This is a joint work with Nicholas Kosar, Benjamin Reiniger, and Elyse Yeager
Recommended from our members
Graph Structure and Coloring
We denote by G=(V,E) a graph with vertex set V and edge set E. A graph G is claw-free if no vertex of G has three pairwise nonadjacent neighbours. Claw-free graphs are a natural generalization of line graphs. This thesis answers several questions about claw-free graphs and line graphs.
In 1988, Chvatal and Sbihi proved a decomposition theorem for claw-free perfect graphs. They showed that claw-free perfect graphs either have a clique-cutset or come from two basic classes of graphs called elementary and peculiar graphs. In 1999, Maffray and Reed successfully described how elementary graphs can be built using line graphs of bipartite graphs and local augmentation. However gluing two claw-free perfect graphs on a clique does not necessarily produce claw-free graphs. The first result of this thesis is a complete structural description of claw-free perfect graphs. We also give a construction for all perfect circular interval graphs. This is joint work with Chudnovsky.
Erdos and Lovasz conjectured in 1968 that for every graph G and all integers s,t≥ 2 such that s+t-1=χ(G) > ω(G), there exists a partition (S,T) of the vertex set of G such that ω(G|S)≥ s and χ(G|T)≥ t. This conjecture is known in the graph theory community as the Erdos-Lovasz Tihany Conjecture. For general graphs, the only settled cases of the conjecture are when s and t are small. Recently, the conjecture was proved for a few special classes of graphs: graphs with stability number 2, line graphs and quasi-line graphs. The second part of this thesis considers the conjecture for claw-free graphs and presents some progresses on it. This is joint work with Chudnovsky and Fradkin.
Reed's ω, ∆, χ conjecture proposes that every graph satisfies χ≤ ⎡½ (Δ+1+ω)⎤ ; it is known to hold for all claw-free graphs. The third part of this thesis considers a local strengthening of this conjecture. We prove the local strengthening for line graphs, then note that previous results immediately tell us that the local strengthening holds for all quasi-line graphs. Our proofs lead to polytime algorithms for constructing colorings that achieve our bounds: The complexity are O(n²) for line graphs and O(n³m²) for quasi-line graphs. For line graphs, this is faster than the best known algorithm for constructing a coloring that achieves the bound of Reed's original conjecture. This is joint work with Chudnovsky, King and Seymour
Distance measures in graphs and subgraphs.
Thesis (M.Sc.)-University of Natal, 1996.In this thesis we investigate how the modification of a graph affects various
distance measures. The questions considered arise in the study of how the
efficiency of communications networks is affected by the loss of links or nodes.
In a graph C, the distance between two vertices is the length of a shortest
path between them. The eccentricity of a vertex v is the maximum distance
from v to any vertex in C. The radius of C is the minimum eccentricity of a
vertex, and the diameter of C is the maximum eccentricity of a vertex. The
distance of C is defined as the sum of the distances between all unordered
pairs of vertices.
We investigate, for each of the parameters radius, diameter and distance
of a graph C, the effects on the parameter when a vertex or edge is removed or
an edge is added, or C is replaced by a spanning tree in which the parameter is
as low as possible. We find the maximum possible change in the parameter
due to such modifications. In addition, we consider the cases where the
removed vertex or edge is one for which the parameter is minimised after
deletion.
We also investigate graphs which are critical with respect to the radius or
diameter, in any of the following senses: the parameter increases when any
edge is deleted, decreases when any edge is added, increases when any vertex
is removed, or decreases when any vertex is removed