95 research outputs found
Permanents, Pfaffian orientations, and even directed circuits
Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in
such a way that the permanent of A equals the determinant of the modified
matrix? When does a real square matrix have the property that every real matrix
with the same sign pattern (that is, the corresponding entries either have the
same sign or are both zero) is nonsingular? When is a hypergraph with n
vertices and n hyperedges minimally nonbipartite? When does a bipartite graph
have a "Pfaffian orientation"? Given a digraph, does it have no directed
circuit of even length? Given a digraph, does it have a subdivision with no
even directed circuit?
It is known that all of the above problems are equivalent. We prove a
structural characterization of the feasible instances, which implies a
polynomial-time algorithm to solve all of the above problems. The structural
characterization says, roughly speaking, that a bipartite graph has a Pfaffian
orientation if and only if it can be obtained by piecing together (in a
specified way) planar bipartite graphs and one sporadic nonplanar bipartite
graph.Comment: 47 pages, published versio
Signless Laplacian spectral radius for a k-extendable graph
Let and be two nonnegative integers with (mod 2), and let
be a graph of order with a 1-factor. Then is said to be
-extendable for if every matching in of size
can be extended to a 1-factor. In this paper, we first establish a lower
bound on the signless Laplacian spectral radius of to ensure that is
-extendable. Then we create some extremal graphs to claim that all the
bounds derived in this article are sharp.Comment: 11 page
Hamiltonicity, Pancyclicity, and Cycle Extendability in Graphs
The study of cycles, particularly Hamiltonian cycles, is very important in many applications.
Bondy posited his famous metaconjecture, that every condition sufficient for Hamiltonicity actually guarantees a graph is pancyclic. Pancyclicity is a stronger structural property than Hamiltonicity.
An even stronger structural property is for a graph to be cycle extendable. Hendry conjectured that any graph which is Hamiltonian and chordal is cycle extendable.
In this dissertation, cycle extendability is investigated and generalized. It is proved that chordal 2-connected K1,3-free graphs are cycle extendable. S-cycle extendability was defined by Beasley and Brown, where S is any set of positive integers. A conjecture is presented that Hamiltonian chordal graphs are {1, 2}-cycle extendable.
Dirac’s Theorem is an classic result establishing a minimum degree condition for a graph to be Hamiltonian. Ore’s condition is another early result giving a sufficient condition for Hamiltonicity. In this dissertation, generalizations of Dirac’s and Ore’s Theorems are presented.
The Chvatal-Erdos condition is a result showing that if the maximum size of an independent set in a graph G is less than or equal to the minimum number of vertices whose deletion increases the number of components of G, then G is Hamiltonian. It is proved here that the Chvatal-Erdos condition guarantees that a graph is cycle extendable. It is also shown that a graph having a Hamiltonian elimination ordering is cycle extendable.
The existence of Hamiltonian cycles which avoid sets of edges of a certain size and certain subgraphs is a new topic recently investigated by Harlan, et al., which clearly has applications to scheduling and communication networks among other things. The theory is extended here to bipartite graphs. Specifically, the conditions for the existence of a Hamiltonian cycle that avoids edges, or some subgraph of a certain size, are determined for the bipartite case.
Briefly, this dissertation contributes to the state of the art of Hamiltonian cycles, cycle extendability and edge and graph avoiding Hamiltonian cycles, which is an important area of graph theory
Online choosability of graphs
We study several problems in graph coloring. In list coloring, each vertex has a set of available colors and must be assigned a color from this set so that adjacent vertices receive distinct colors; such a coloring is an -coloring, and we then say that is -colorable. Given a graph and a function , we say that is -choosable if is -colorable for any list assignment such that for all . When for all and is -choosable, we say that is -choosable. The least such that is -choosable is the choice number, denoted . We focus on an online version of this problem, which is modeled by the Lister/Painter game.
The game is played on a graph in which every vertex has a positive number of tokens. In each round, Lister marks a nonempty subset of uncolored vertices, removing one token at each marked vertex. Painter responds by selecting a subset of that forms an independent set in . A color distinct from those used on previous rounds is given to all vertices in . Lister wins by marking a vertex that has no tokens, and Painter wins by coloring all vertices in . When Painter has a winning strategy, we say that is -paintable. If for all and is -paintable, then we say that is -paintable. The least such that is -paintable is the paint number, denoted \pa(G).
In Chapter 2, we develop useful tools for studying the Lister/Painter game. We study the paintability of graph joins and of complete bipartite graphs. In particular, \pa(K_{k,r})\le k if and only if .
In Chapter 3, we study the Lister/Painter game with the added restriction that the proper coloring produced by Painter must also satisfy some property . The main result of Chapter 3 provides a general method to give a winning strategy for Painter when a strategy for the list coloring problem is already known. One example of a property is that of having an -dynamic coloring, where a proper coloring is -dynamic if each vertex has at least distinct colors in its neighborhood. For any graph and any , we give upper bounds on how many tokens are necessary for Painter to produce an -dynamic coloring of . The upper bounds are in terms of and the genus of a surface on which embeds.
In Chapter 4, we study a version of the Lister/Painter game in which Painter must assign colors to each vertex so that adjacent vertices receive disjoint color sets. We characterize the graphs in which tokens is sufficient to produce such a coloring. We strengthen Brooks' Theorem as well as Thomassen's result that planar graphs are 5-choosable.
In Chapter 5, we study sum-paintability. The sum-paint number of a graph , denoted \spa(G), is the least over all such that is -paintable. We prove the easy upper bound: \spa(G)\le|V(G)|+|E(G)|. When \spa(G)=|V(G)|+|E(G)|, we say that is sp-greedy. We determine the sum-paintability of generalized theta-graphs. The generalized theta-graph consists of two vertices joined by paths of lengths \VEC \ell1k. We conjecture that outerplanar graphs are sp-greedy and prove several partial results toward this conjecture.
In Chapter 6, we study what happens when Painter is allowed to allocate tokens as Lister marks vertices. The slow-coloring game is played by Lister and Painter on a graph . Lister marks a nonempty set of uncolored vertices and scores 1 point for each marked vertex. Painter colors all vertices in an independent subset of the marked vertices with a color distinct from those used previously in the game. The game ends when all vertices have been colored. The sum-color cost of a graph , denoted \scc(G), is the maximum score Lister can guarantee in the slow-coloring game on . We prove several general lower and upper bounds for \scc(G). In more detail, we study trees and prove sharp upper and lower bounds over all trees with vertices. We give a formula to determine \scc(G) exactly when . Separately, we prove that \scc(G)=\spa(G) if and only if is a disjoint union of cliques. Lastly, we give lower and upper bounds on \scc(K_{r,s})
Rooted structures in graphs: a project on Hadwiger's conjecture, rooted minors, and Tutte cycles
Hadwigers Vermutung ist eine der anspruchsvollsten Vermutungen für Graphentheoretiker und bietet eine weitreichende Verallgemeinerung des Vierfarbensatzes. Ausgehend von dieser offenen Frage der strukturellen Graphentheorie werden gewurzelte Strukturen in Graphen diskutiert. Eine Transversale einer Partition ist definiert als eine Menge, welche genau ein Element aus jeder Menge der Partition enthält und sonst nichts. Für einen Graphen G und eine Teilmenge T seiner Knotenmenge ist ein gewurzelter Minor von G ein Minor, der T als Transversale seiner Taschen enthält. Sei T eine Transversale einer Färbung eines Graphen, sodass es ein System von kanten-disjunkten Wegen zwischen allen Knoten aus T gibt; dann stellt sich die Frage, ob es möglich ist, die Existenz eines vollständigen, in T gewurzelten Minors zu gewährleisten. Diese Frage ist eng mit Hadwigers Vermutung verwoben: Eine positive Antwort würde Hadwigers Vermutung für eindeutig färbbare Graphen bestätigen. In dieser Arbeit wird ebendiese Fragestellung untersucht sowie weitere Konzepte vorgestellt, welche bekannte Ideen der strukturellen Graphentheorie um eine Verwurzelung erweitern. Beispielsweise wird diskutiert, inwiefern hoch zusammenhängende Teilmengen der Knotenmenge einen hoch zusammenhängenden, gewurzelten Minor erzwingen. Zudem werden verschiedene Ideen von Hamiltonizität in planaren und nicht-planaren Graphen behandelt.Hadwiger's Conjecture is one of the most tantalising conjectures for graph theorists and offers a far-reaching generalisation of the Four-Colour-Theorem. Based on this major issue in structural graph theory, this thesis explores rooted structures in graphs. A transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. Given a graph G and a subset T of its vertex set, a rooted minor of G is a minor such that T is a transversal of its branch set. Assume that a graph has a transversal T of one of its colourings such that there is a system of edge-disjoint paths between all vertices from T; it comes natural to ask whether such graphs contain a minor rooted at T. This question of containment is strongly related to Hadwiger's Conjecture; indeed, a positive answer would prove Hadwiger's Conjecture for uniquely colourable graphs. This thesis studies the aforementioned question and besides, presents several other concepts of attaching rooted relatedness to ideas in structural graph theory. For instance, whether a highly connected subset of the vertex set forces a highly connected rooted minor. Moreover, several ideas of Hamiltonicity in planar and non-planar graphs are discussed
Analyzing massive datasets with missing entries: models and algorithms
We initiate a systematic study of computational models to analyze algorithms for massive datasets with missing or erased entries and study the relationship of our models with existing algorithmic models for large datasets.
We focus on algorithms whose inputs are naturally represented as functions, codewords, or graphs. First, we generalize the property testing model, one of the most widely studied models of sublinear-time algorithms, to account for the presence of adversarially erased function values. We design efficient erasure-resilient property testing algorithms for several fundamental properties of real-valued functions such as monotonicity, Lipschitz property, convexity, and linearity.
We then investigate the problems of local decoding and local list decoding of codewords containing erasures. We show that, in some cases, these problems are strictly easier than the corresponding problems of decoding codewords containing errors. Moreover, we use this understanding to show a separation between our erasure-resilient property testing model and the (error) tolerant property testing model. The philosophical message of this separation is that errors occurring in large datasets are, in general, harder to deal with, than erasures.
Finally, we develop models and notions to reason about algorithms that are intended to run on large graphs with missing edges. While running algorithms on large graphs containing several missing edges, it is desirable to output solutions that are close to the solutions output when there are no missing edges. With this motivation, we define average sensitivity, a robustness metric for graph algorithms. We discuss various useful features of our definition and design approximation algorithms with good average sensitivity bounds for several optimization problems on graphs. We also define a model of erasure-resilient sublinear-time graph algorithms and design an efficient algorithm for testing connectivity of graphs
- …