14,238 research outputs found
Problems in graph theory and partially ordered sets
This dissertation answers problems in three areas of combinatorics - processes on graphs, graph coloring, and antichains in a partially ordered set.First we consider Zero Forcing on graphs, an iterative infection process introduced by AIM Minimum Rank - Special Graphs Workgroup in 2008. The Zero Forcing process is a graph infection process obeying the following rules: a white vertex is turned black if it is the only white neighbor of some black vertex. The Zero Forcing Number of a graph is the minimum cardinality over all sets of black vertices such that, after a finite number of iterations, every vertex is black. We establish some results about the zero forcing number of certain graphs and provide a counter example of a conjecture of Gentner and Rautenbach. This chapter is joint with Gabor Meszaros, Antonio Girao, and Chapter 3 appears in Discrete Math, Vol. 341(4).In the second part, we consider problems in the area of Dynamic Coloring of graphs. Originally introduced by Montgomery in 2001, the r-dynamic chromatic number of a graph G is the least k such that V(G) is properly colored, and each vertex is adjacent to at least r different colors. In this coloring regime, we prove some bounds for graphs with lattice like structures, hypercubes, generalized intervals, and other graphs of interest. Next, we establish some of the first results in the area of r-dynamic coloring on random graphs. The work in this section is joint with Peter van Hintum.In the third part, we consider a question about the structure of the partially ordered set of all connected graphs. Let G be the set of all connected graphs on vertex set [n]. Define the partial ordering \u3c on G as follows: for G,H G let G \u3c H if E(G) E(H). The poset (G
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
Domination and coloring are two classic problems in graph theory. The major
focus of this paper is the CD-COLORING problem which combines the flavours of
domination and colouring. Let be an undirected graph. A proper vertex
coloring of is a if each color class has a dominating vertex
in . The minimum integer for which there exists a of
using colors is called the cd-chromatic number, . A set
is a total dominating set if any vertex in has a neighbor
in . The total domination number, of is the minimum
integer such that has a total dominating set of size . A set
is a if no two vertices in lie at a
distance 2 in . The separated-cluster number, , of is the
maximum integer such that has a separated-cluster of size .
In this paper, first we explore the connection between CD-COLORING and TOTAL
DOMINATION. We prove that CD-COLORING and TOTAL DOMINATION are NP-Complete on
triangle-free -regular graphs for each fixed integer . We also
study the relationship between the parameters and .
Analogous to the well-known notion of `perfectness', here we introduce the
notion of `cd-perfectness'. We prove a sufficient condition for a graph to
be cd-perfect (i.e. , for any induced subgraph
of ) which is also necessary for certain graph classes (like triangle-free
graphs). Here, we propose a generalized framework via which we obtain several
exciting consequences in the algorithmic complexities of special graph classes.
In addition, we settle an open problem by showing that the SEPARATED-CLUSTER is
polynomially solvable for interval graphs
Chromatic Quasisymmetric Class Functions for combinatorial Hopf monoids
We study the chromatic quasisymmetric class function of a linearized combinatorial Hopf monoid. Given a linearized combinatorial Hopf monoid H, and an H-structure h on a set N, there are proper colorings of h, generalizing graph colorings and poset partitions. We show that the automorphism group of h acts on the set of proper colorings. The chromatic quasisymmetric class function enumerates the fixed points of this action, weighting each coloring with a monomial. For the Hopf monoid of graphs this invariant generalizes Stanley\u27s chromatic symmetric function and specializes to the orbital chromatic polynomial of Cameron and Kayibi.
We also introduce the flag quasisymmetric class function of a balanced relative simplicial complex equipped with a group action. We show that, under certain conditions, the chromatic quasisymmetric class function of h is the flag quasisymmetric class function of a balanced relative simplicial complex that we call the coloring complex of h. We use this result to deduce various inequalities for the associated orbital polynomial invariants. We apply these results to several examples related to enumerating graph colorings, poset partitions, generic functions on matroids or generalized permutohedra, and others
D-colorable digraphs with large girth
In 1959 Paul Erdos (Graph theory and probability, Canad. J. Math. 11 (1959), 34-38) famously proved, nonconstructively, that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number. This result, along with its proof, has had a number of descendants (D. Bokal, G. Fijavz, M. Juvan, P.M. Kayll and B. Mohar, The circular chromatic number of a digraph, J. Graph Theory 46 (2004), 227-240; B. Bollobas and N. Sauer, Uniquely colourable graphs with large girth, Canad. J. Math. 28 (1976), 1340-1344; J. Nesetril and X. Zhu, On sparse graphs with given colorings and homomorphisms, J. Combin. Theory Ser. B 90 (2004), 161-172; X. Zhu, Uniquely H-colorable graphs with large girth, J. Graph Theory 23 (1996), 33-41) that have extended and generalized the result while strengthening the techniques used to achieve it. We follow the lead of Xuding Zhu (op. cit.) who proved that, for a suitable graph H, there exist graphs of arbitrarily large girth that are uniquely H-colorable. We establish an analogue of Zhu\u27s results in a digraph setting.
Let C and D be digraphs. A mapping f:V(D)&rarr V(C) is a C-coloring if for every arc uv of D, either f(u)f(v) is an arc of C or f(u)=f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colorable if it admits a C-coloring and that D is uniquely C-colorable if it is surjectively C-colorable and any two C-colorings of D differ by an automorphism of C. We prove that if D is a digraph that is not C-colorable, then there exist graphs of arbitrarily large girth that are D-colorable but not C-colorable. Moreover, for every digraph D that is uniquely D-colorable, there exists a uniquely D-colorable digraph of arbitrarily large girth
- …