14 research outputs found
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances
Clique-width and treewidth are two of the most important and useful graph parameters, and several problems can be solved efficiently when restricted to graphs of bounded clique-width or treewidth. Bounded treewidth implies bounded clique-width, but not vice versa. Problems like Longest Cycle, Longest Path, MaxCut, Edge Dominating Set, and Graph Coloring are fixed-parameter tractable when parameterized by the treewidth, but they cannot be solved in FPT time when parameterized by the clique-width unless FPT = W[1], as shown by Fomin, Golovach, Lokshtanov, and Saurabh [SIAM J. Comput. 2010, SIAM J. Comput. 2014]. For a given problem that is fixed-parameter tractable when parameterized by treewidth, but intractable when parameterized by clique-width, there may exist infinite families of instances of bounded clique-width and unbounded treewidth where the problem can be solved efficiently. In this work, we initiate a systematic study of the parameters co-treewidth (the treewidth of the complement of the input graph) and co-degeneracy (the degeneracy of the complement of the input graph). We show that Longest Cycle, Longest Path, and Edge Dominating Set are FPT when parameterized by co-degeneracy. On the other hand, Graph Coloring is para-NP-complete when parameterized by co-degeneracy but FPT when parameterized by the co-treewidth. Concerning MaxCut, we give an FPT algorithm parameterized by co-treewidth, while we leave open the complexity of the problem parameterized by co-degeneracy. Additionally, we show that Precoloring Extension is fixed-parameter tractable when parameterized by co-treewidth, while this problem is known to be W[1]-hard when parameterized by treewidth. These results give evidence that co-treewidth is a useful width parameter for handling dense instances of problems for which an FPT algorithm for clique-width is unlikely to exist. Finally, we develop an algorithmic framework for co-degeneracy based on the notion of Bondy-Chvátal closure.publishedVersio
A look at cycles containing specified elements of a graph
AbstractThis article is intended as a brief survey of problems and results dealing with cycles containing specified elements of a graph. It is hoped that this will help researchers in the area to identify problems and areas of concentration
A Variant of the VC-Dimension with Applications to Depth-3 Circuits
We introduce the following variant of the VC-dimension. Given and a positive integer , we define to be the
size of the largest subset such that the projection of on
every subset of of size is the -dimensional cube. We show that
determining the largest cardinality of a set with a given
dimension is equivalent to a Tur\'an-type problem related to the total number
of cliques in a -uniform hypergraph. This allows us to beat the
Sauer--Shelah lemma for this notion of dimension. We use this to obtain several
results on -circuits, i.e., depth- circuits with top gate OR and
bottom fan-in at most :
* Tight relationship between the number of satisfying assignments of a
-CNF and the dimension of the largest projection accepted by it, thus
improving Paturi, Saks, and Zane (Comput. Complex. '00).
* Improved -circuit lower bounds for affine dispersers for
sublinear dimension. Moreover, we pose a purely hypergraph-theoretic conjecture
under which we get further improvement.
* We make progress towards settling the complexity of the inner
product function and all degree- polynomials over in general.
The question of determining the complexity of IP was recently
posed by Golovnev, Kulikov, and Williams (ITCS'21)
Degree Conditions for Hamiltonian Properties of Claw-free Graphs
This thesis contains many new contributions to the field of hamiltonian graph theory, a very active subfield of graph theory. In particular, we have obtained new sufficient minimum degree and degree sum conditions to guarantee that the graphs satisfying these conditions, or their line graphs, admit a Hamilton cycle (or a Hamilton path), unless they have a small order or they belong to well-defined classes of exceptional graphs. Here, a Hamilton cycle corresponds to traversing the vertices and edges of the graph in such a way that all their vertices are visited exactly once, and we return to our starting vertex (similarly, a Hamilton path reflects a similar way of traversing the graph, but without the last restriction, so we might terminate at a different vertex). In Chapter 1, we presented an introduction to the topics of this thesis together with Ryjáček’s closure for claw-free graphs, Catlin’s reduction method, and the reduction of the core of a graph. In Chapter 2, we found the best possible bounds for the minimum degree condition and the minimum degree sums condition of adjacent vertices for traceability of 2-connected claw-free graph, respectively. In addition, we decreased these lower bounds with one family of well characterized exceptional graphs. In Chapter 3, we extended recent results about the conjecture of Benhocine et al. and results about the conjecture of Z.-H Chen and H.-J Lai. In Chapters 4, 5 and 6, we have successfully tried to unify and extend several existing results involving the degree and neighborhood conditions for the hamiltonicity and traceability of 2-connected claw-free graphs. Throughout this thesis, we have investigated the existence of Hamilton cycles and Hamilton paths under different types of degree and neighborhood conditions, including minimum degree conditions, minimum degree sum conditions on adjacent pairs of vertices, minimum degree sum conditions over all independent sets of t vertices of a graph, minimum cardinality conditions on the neighborhood union over all independent sets of t vertices of a graph, as well minimum cardinality conditions on the neighborhood union over all t vertex sets of a graph. Despite our new contributions, many problems and conjectures remain unsolved
Hamilton decompositions of 6-regular abelian Cayley graphs
In 1969, Lovasz asked whether every connected, vertex-transitive graph has a Hamilton path. This question has generated a considerable amount of interest, yet remains vastly open. To date, there exist no known connected, vertex-transitive graph that does not possess a Hamilton path. For the Cayley graphs, a subclass of vertex-transitive graphs, the following conjecture was made:
Weak Lovász Conjecture: Every nontrivial, finite, connected Cayley graph is hamiltonian.
The Chen-Quimpo Theorem proves that Cayley graphs on abelian groups flourish with Hamilton cycles, thus prompting Alspach to make the following conjecture:
Alspach Conjecture: Every 2k-regular, connected Cayley graph on a finite abelian group has a Hamilton decomposition.
Alspach’s conjecture is true for k = 1 and 2, but even the case k = 3 is still open. It is this case that this thesis addresses.
Chapters 1–3 give introductory material and past work on the conjecture. Chapter 3 investigates the relationship between 6-regular Cayley graphs and associated quotient graphs. A proof of Alspach’s conjecture is given for the odd order case when k = 3. Chapter 4 provides a proof of the conjecture for even order graphs with 3-element connection sets that have an element generating a subgroup of index 2, and having a linear dependency among the other generators.
Chapter 5 shows that if Γ = Cay(A, {s1, s2, s3}) is a connected, 6-regular, abelian Cayley graph of even order, and for some1 ≤ i ≤ 3, Δi = Cay(A/(si), {sj1 , sj2}) is 4-regular, and Δi ≄ Cay(ℤ3, {1, 1}), then Γ has a Hamilton decomposition. Alternatively stated, if Γ = Cay(A, S) is a connected, 6-regular, abelian Cayley graph of even order, then Γ has a Hamilton decomposition if S has no involutions, and for some s ∈ S, Cay(A/(s), S) is 4-regular, and of order at least 4.
Finally, the Appendices give computational data resulting from C and MAGMA programs used to generate Hamilton decompositions of certain non-isomorphic Cayley graphs on low order abelian groups
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum