440 research outputs found

    Circuits and Cycles in Graphs and Matroids

    Get PDF
    This dissertation mainly focuses on characterizing cycles and circuits in graphs, line graphs and matroids. We obtain the following advances. 1. Results in graphs and line graphs. For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line graph Ln(G) is panconnected. A path P is a divalent path of G if the internal vertices of P are of degree 2 in G. If every edge of P is a cut edge of G, then P is a bridge divalent path of G; if the two ends of P are of degree s and t, respectively, then P is called a divalent (s, t)-path. Let l(G) = max{m : G has a divalent path of length m that is not both of length 2 and in a K3}. We prove the following. (i) If G is a connected triangular graph, then L(G) is panconnected if and only if G is essentially 3-edge-connected. (ii) pc(G) ≤ l(G) + 2. Furthermore, if l(G) ≥ 2, then pc(G) = l(G) + 2 if and only if for some integer t ≥ 3, G has a bridge divalent (3, t)-path of length l(G). For a graph G, the supereulerian width μ′(G) of a graph G is the largest integer s such that G has a spanning (k;u,v)-trail-system, for any integer k with 1 ≤ k ≤ s, and for any u, v ∈ V (G) with u ̸= v. Thus μ′(G) ≥ 2 implies that G is supereulerian, and so graphs with higher supereulerian width are natural generalizations of supereulerian graphs. Settling an open problem of Bauer, Catlin in [J. Graph Theory 12 (1988), 29-45] proved that if a simple graph G on n ≥ 17 vertices satisfy δ(G) ≥ n − 1, then μ′(G) ≥ 2. In this paper, we show that for 4 any real numbers a, b with 0 \u3c a \u3c 1 and any integer s \u3e 0, there exists a finite graph family F = F(a,b,s) such that for a simple graph G with n = |V(G)|, if for any u,v ∈ V(G) with uv ∈/ E(G), max{dG(u), dG(v)} ≥ an + b, then either μ′(G) ≥ s + 1 or G is contractible to a member in F. When a = 1,b = −3, we show that if n is sufficiently large, K3,3 is the only 42 obstacle for a 3-edge-connected graph G to satisfy μ′(G) ≥ 3. An hourglass is a graph obtained from K5 by deleting the edges in a cycle of length 4, and an hourglass-free graph is one that has no induced subgraph isomorphic to an hourglass. Kriesell in [J. Combin. Theory Ser. B, 82 (2001), 306-315] proved that every 4-connected hourglass-free line graph is Hamilton-connected, and Kaiser, Ryj ́aˇcek and Vr ́ana in [Discrete Mathematics, 321 (2014) 1-11] extended it by showing that every 4-connected hourglass-free line graph is 1- Hamilton-connected. We characterize all essentially 4-edge-connected graphs whose line graph is hourglass-free. Consequently we prove that for any integer s and for any hourglass-free line graph L(G), each of the following holds. (i) If s ≥ 2, then L(G) is s-hamiltonian if and only if κ(L(G)) ≥ s + 2; (ii) If s ≥ 1, then L(G) is s-Hamilton-connected if and only if κ(L(G)) ≥ s + 3. For integers s1, s2, s3 \u3e 0, let Ns1,s2,s3 denote the graph obtained by identifying each vertex of a K3 with an end vertex of three disjoint paths Ps1+1, Ps2+1, Ps3+1 of length s1,s2 and s3, respectively. We prove the following results. (i)LetN1 ={Ns1,s2,s3 :s1 \u3e0,s1 ≥s2 ≥s3 ≥0ands1+s2+s3 ≤6}. Thenforany N ∈ N1, every N-free line graph L(G) with |V (L(G))| ≥ s + 3 is s-hamiltonian if and only if κ(L(G)) ≥ s + 2. (ii)LetN2={Ns1,s2,s3 :s1\u3e0,s1≥s2≥s3≥0ands1+s2+s3≤4}.ThenforanyN∈N2, every N -free line graph L(G) with |V (L(G))| ≥ s + 3 is s-Hamilton-connected if and only if κ(L(G)) ≥ s + 3. 2. Results in matroids. A matroid M with a distinguished element e0 ∈ E(M) is a rooted matroid with e0 being the root. We present a characterization of all connected binary rooted matroids whose root lies in at most three circuits, and a characterization of all connected binary rooted matroids whose root lies in all but at most three circuits. While there exist infinitely many such matroids, the number of serial reductions of such matroids is finite. In particular, we find two finite families of binary matroids M1 and M2 and prove the following. (i) For some e0 ∈ E(M), M has at most three circuits containing e0 if and only if the serial reduction of M is isomorphic to a member in M1. (ii) If for some e0 ∈ E(M), M has at most three circuits not containing e0 if and only if the serial reduction of M is isomorphic to a member in M2. These characterizations will be applied to show that every connected binary matroid M with at least four circuits has a 1-hamiltonian circuit graph

    Spanning Trees and Spanning Eulerian Subgraphs with Small Degrees. II

    Full text link
    Let GG be a connected graph with XV(G)X\subseteq V(G) and with the spanning forest FF. Let λ[0,1]\lambda\in [0,1] be a real number and let η:X(λ,)\eta:X\rightarrow (\lambda,\infty) be a real function. In this paper, we show that if for all SXS\subseteq X, ω(GS)vS(η(v)2)+2λ(eG(S)+1)\omega(G\setminus S)\le\sum_{v\in S}\big(\eta(v)-2\big)+2-\lambda(e_G(S)+1), then GG has a spanning tree TT containing FF such that for each vertex vXv\in X, dT(v)η(v)λ+max{0,dF(v)1}d_T(v)\le \lceil\eta(v)-\lambda\rceil+\max\{0,d_F(v)-1\}, where ω(GS)\omega(G\setminus S) denotes the number of components of GSG\setminus S and eG(S)e_G(S) denotes the number of edges of GG with both ends in SS. This is an improvement of several results and the condition is best possible. Next, we also investigate an extension for this result and deduce that every kk-edge-connected graph GG has a spanning subgraph HH containing mm edge-disjoint spanning trees such that for each vertex vv, dH(v)mk(dG(v)2m)+2md_H(v)\le \big\lceil \frac{m}{k}(d_G(v)-2m)\big\rceil+2m, where k2mk\ge 2m; also if GG contains kk edge-disjoint spanning trees, then HH can be found such that for each vertex vv, dH(v)mk(dG(v)m)+md_H(v)\le \big\lceil \frac{m}{k}(d_G(v)-m)\big\rceil+m, where kmk\ge m. Finally, we show that strongly 22-tough graphs, including (3+1/2)(3+1/2)-tough graphs of order at least three, have spanning Eulerian subgraphs whose degrees lie in the set {2,4}\{2,4\}. In addition, we show that every 11-tough graph has spanning closed walk meeting each vertex at most 22 times and prove a long-standing conjecture due to Jackson and Wormald (1990).Comment: 46 pages, Keywords: Spanning tree; spanning Eulerian; spanning closed walk; connected factor; toughness; total exces

    Defining Recursive Predicates in Graph Orders

    Full text link
    We study the first order theory of structures over graphs i.e. structures of the form (G,τ\mathcal{G},\tau) where G\mathcal{G} is the set of all (isomorphism types of) finite undirected graphs and τ\tau some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine recognizable string encodings of graphs. We also define the notion of an arithmetical relation over graphs using a total order t\leq_t on the set G\mathcal{G} such that (G,t\mathcal{G},\leq_t) is isomorphic to (N,\mathbb{N},\leq). We introduce the notion of a \textit{capable} structure over graphs, which is one satisfying the conditions : (1) definability of arithmetic, (2) definability of cardinality of a graph, and (3) definability of two particular graph predicates related to vertex labellings of graphs. We then show any capable structure can define every arithmetical predicate over graphs. As a corollary, any capable structure also defines every recursive graph relation. We identify capable structures which are expansions of graph orders, which are structures of the form (G,\mathcal{G},\leq) where \leq is a partial order. We show that the subgraph order i.e. (G,s\mathcal{G},\leq_s), induced subgraph order with one constant P3P_3 i.e. (G,i,P3\mathcal{G},\leq_i,P_3) and an expansion of the minor order for counting edges i.e. (G,m,sameSize(x,y)\mathcal{G},\leq_m,sameSize(x,y)) are capable structures. In the course of the proof, we show the definability of several natural graph theoretic predicates in the subgraph order which may be of independent interest. We discuss the implications of our results and connections to Descriptive Complexity

    Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems

    Get PDF
    Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segments with endpoints in S. We present an algorithm that computes the number of triangulations on a given set of n points in time n^{ (11+ o(1)) sqrt{n} }, significantly improving the previous best running time of O(2^n n^2) by Alvarez and Seidel [SoCG 2013]. Our main tool is identifying separators of size O(sqrt{n}) of a triangulation in a canonical way. The definition of the separators are based on the decomposition of the triangulation into nested layers ("cactus graphs"). Based on the above algorithm, we develop a simple and formal framework to count other non-crossing straight-line graphs in n^{O(sqrt{n})} time. We demonstrate the usefulness of the framework by applying it to counting non-crossing Hamilton cycles, spanning trees, perfect matchings, 3-colorable triangulations, connected graphs, cycle decompositions, quadrangulations, 3-regular graphs, and more

    Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems

    Get PDF
    Given a set of nn points SS in the plane, a triangulation TT of SS is a maximal set of non-crossing segments with endpoints in SS. We present an algorithm that computes the number of triangulations on a given set of nn points in time n(11+o(1))nn^{(11+ o(1))\sqrt{n} }, significantly improving the previous best running time of O(2nn2)O(2^n n^2) by Alvarez and Seidel [SoCG 2013]. Our main tool is identifying separators of size O(n)O(\sqrt{n}) of a triangulation in a canonical way. The definition of the separators are based on the decomposition of the triangulation into nested layers ("cactus graphs"). Based on the above algorithm, we develop a simple and formal framework to count other non-crossing straight-line graphs in nO(n)n^{O(\sqrt{n})} time. We demonstrate the usefulness of the framework by applying it to counting non-crossing Hamilton cycles, spanning trees, perfect matchings, 33-colorable triangulations, connected graphs, cycle decompositions, quadrangulations, 33-regular graphs, and more.Comment: 47 pages, 23 Figures, to appear in SoCG 201
    corecore