SearcharxivSearch

arXiv subjects

Vaidy Sivaraman

Publications and source records attributed to Vaidy Sivaraman.

At least 19 recordsLinked to original sources

Extensions and Deletions of matroid classes closed under flats

We call a class of matroids hereditary if it is closed under restriction to flats. For a hereditary class $\mathcal{M}$, its extension class consists of all matroids in $\mathcal{M}$ together with their single-element extensions. The deletion class consists of all matroids in $\mathcal{M}$ along with their single-element deletions. We prove that if $\mathcal{M}$ has finitely many forbidden flats, then the forbidden flats for its extension class have bounded rank. For $GF(q)$-representable matroids where $q$ is in $\{2,3\}$, we exploit correspondence with $2$-colorings of projective geometries to establish the analogous result for the deletion class. We also note the consequences for hereditary classes of graphs, discussing the interplay of graphs and matroids.

math.CO

Structural Bounds and Forbidden Induced Subgraphs for Edge-Add Graph Classes

A class $\mathcal{G}$ of graphs is hereditary if it is closed under taking induced subgraphs. We investigate the edge-add class, $\mathcal{G}^{\mathrm{add}}$, consisting of graphs that can be made members of $\mathcal{G}$ by adding at most one edge. While it is known that the operations of vertex deletion and edge deletion preserve the finiteness of forbidden induced subgraphs for classes with finite exclusions, the behavior of edge addition on classes with infinite exclusions remains largely unexplored. We characterize the edge-add class of chordal graphs by their forbidden induced subgraphs and extend the result to a general finiteness theorem: for any fixed $p\ge0$, the set of forbidden induced subgraphs for $p$-edge-add chordal graphs that are not cycles is finite. In contrast, we show that this phenomenon does not extend to perfect graphs. Furthermore, we provide explicit structural bounds proving that edge addition preserves finiteness for base classes with finitely many exclusions. We conclude by providing the complete structural characterizations and explicit minimal obstruction lists for the edge-add classes of split and threshold graphs, and generalize these results to $(p,q)$-edge split graphs.

math.CO

Apex Graphs and Cographs

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $\mathcal{G}^\mathrm{apex}$ the class of graphs $G$ that contain a vertex $v$ such that $G-v$ is in $\mathcal{G}$. We prove that if a hereditary class $\mathcal{G}$ has finitely many forbidden induced subgraphs, then so does $\mathcal{G}^\mathrm{apex}$. The hereditary class of cographs consists of all graphs $G$ that can be generated from $K_1$ using complementation and disjoint union. A graph is an apex cograph if it contains a vertex whose deletion results in a cograph. Cographs are precisely the graphs that do not have the $4$-vertex path as an induced subgraph. Our main result finds all such forbidden induced subgraphs for the class of apex cographs.

math.CO

Edge-apexing in hereditary classes of graphs

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is hereditary and prove that if a hereditary class $\mathcal{G}$ has finitely many forbidden induced subgraphs, then so does $G^{epex}$. The hereditary class of cographs consists of all graphs $G$ that can be generated from $K_1$ using complementation and disjoint union. Cographs are precisely the graphs that do not have the $4$-vertex path as an induced subgraph. For the class of edge-apex cographs our main result bounds the order of such forbidden induced subgraphs by 8 and finds all of them by computer search.

math.CO

Hereditary Nordhaus-Gaddum Graphs

Nordhaus and Gaddum proved in 1956 that the sum of the chromatic number $χ$ of a graph $G$ and its complement is at most $|G|+1$. The Nordhaus-Gaddum graphs are the class of graphs satisfying this inequality with equality, and are well-understood. In this paper we consider a hereditary generalization: graphs $G$ for which all induced subgraphs $H$ of $G$ satisfy $χ(H) + χ(\overline{H}) \le |H|$. We characterize the forbidden induced subgraphs of this class and find its intersection with a number of common classes, including line graphs. We also discuss $χ$-boundedness and algorithmic results.

math.CO

Two Hamiltonian cycles

If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.

math.CO

Coloring graph classes with no induced fork via perfect divisibility

For a graph $G$, $χ(G)$ will denote its chromatic number, and $ω(G)$ its clique number. A graph $G$ is said to be perfectly divisible if for all induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A$, $B$ such that $H[A]$ is perfect and $ω(H[B]) < ω(H)$. An integer-valued function $f$ is called a $χ$-binding function for a hereditary class of graphs $\cal C$ if $χ(G) \leq f(ω(G))$ for every graph $G\in \cal C$. The fork is the graph obtained from the complete bipartite graph $K_{1,3}$ by subdividing an edge once. The problem of finding a polynomial $χ$-binding function for the class of fork-free graphs is open. In this paper, we study the structure of some classes of fork-free graphs; in particular, we study the class of (fork,$F$)-free graphs $\cal G$ in the context of perfect divisibility, where $F$ is a graph on five vertices with a stable set of size three, and show that every $G\in \cal G$ satisfies $χ(G)\leq ω(G)^2$. We also note that the class $\cal G$ does not admit a linear $χ$-binding function.

math.CO

The family of bicircular matroids closed under duality

We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their minors.

math.CO

Cop number of graphs without long holes

A hole in a graph is an induced cycle of length at least 4. We give a simple winning strategy for t-3 cops to capture a robber in the game of cops and robbers played in a graph that does not contain a hole of length at least t. This strengthens a theorem of Joret-Kaminski-Theis, who proved that t-2 cops have a winning strategy in such graphs. As a consequence of our bound, we also give an inequality relating the cop number and the Dilworth number of a graph.

math.CO

Classes of graphs with no long cycle as a vertex-minor are polynomially $χ$-bounded

A class $\mathcal G$ of graphs is $χ$-bounded if there is a function $f$ such that for every graph $G\in \mathcal G$ and every induced subgraph $H$ of $G$, $χ(H)\le f(ω(H))$. In addition, we say that $\mathcal G$ is polynomially $χ$-bounded if $f$ can be taken as a polynomial function. We prove that for every integer $n\ge3$, there exists a polynomial $f$ such that $χ(G)\le f(ω(G))$ for all graphs with no vertex-minor isomorphic to the cycle graph $C_n$. To prove this, we show that if $\mathcal G$ is polynomially $χ$-bounded, then so is the closure of $\mathcal G$ under taking the $1$-join operation.

math.CO

Cop number of $2K_2$-free graphs

We prove that the cop number of a $2K_2$-free graph is at most $2$ if it has diameter $3$ or does not have an induced cycle of length $k$, where $k \ \in \{3,4,5\}$. We conjecture that the cop number of every $2K_2$-free graph is at most $2$.

math.CO

An application of the Gyárfás path argument

We adapt the Gyárfás path argument to prove that $t-2$ cops can capture a robber, in at most $t-1$ moves, in the game of cops and robbers played in a graph that does not contain the $t$-vertex path as an induced subgraph.

math.CO

The class of $(P_7,C_4,C_5)$-free graphs: decomposition, algorithms, and $χ$-boundedness

As usual, $P_n$ ($n \geq 1$) denotes the path on $n$ vertices, and $C_n$ ($n \geq 3$) denotes the cycle on $n$ vertices. For a family $\mathcal{H}$ of graphs, we say that a graph $G$ is $\mathcal{H}$-free if no induced subgraph of $G$ is isomorphic to any graph in $\mathcal{H}$. We present a decomposition theorem for the class of $(P_7,C_4,C_5)$-free graphs; in fact, we give a complete structural characterization of $(P_7,C_4,C_5)$-free graphs that do not admit a clique-cutset. We use this decomposition theorem to show that the class of $(P_7,C_4,C_5)$-free graphs is $χ$-bounded by a linear function (more precisely, every $(P_7,C_4,C_5)$-free graph $G$ satisfies $χ(G) \leq \frac{3}{2} ω(G)$). We also use the decomposition theorem to construct an $O(n^3)$ algorithm for the minimum coloring problem, an $O(n^2m)$ algorithm for the maximum weight stable set problem, and an $O(n^3)$ algorithm for the maximum weight clique problem for this class, where $n$ denotes the number of vertices and $m$ the number of edges of the input graph.

math.CO

Sum-perfect graphs

Inspired by a famous characterization of perfect graphs due to Lovász, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$, $α(H) + ω(H) \geq |V(H)|$. (Here $α$ and $ω$ denote the stability number and clique number, respectively.) We give a set of $27$ graphs and we prove that a graph $G$ is sum-perfect if and only if $G$ does not contain any of the graphs in the set as an induced subgraph.

math.CO

Four NP-complete problems about generalizations of perfect graphs

We show that the following problems are NP-complete. 1. Can the vertex set of a graph be partitioned into two sets such that each set induces a perfect graph? 2. Is the difference between the chromatic number and clique number at most $1$ for every induced subgraph of a graph? 3. Can the vertex set of every induced subgraph of a graph be partitioned into two sets such that the first set induces a perfect graph, and the clique number of the graph induced by the second set is smaller than that of the original induced subgraph? 4. Does a graph contain a stable set whose deletion results in a perfect graph? The proofs of the NP-completeness of the four problems follow the same pattern: Showing that all the four problems are NP-complete when restricted to triangle-free graphs by using results of Maffray and Preissmann on $3$-colorability and $4$-colorability of triangle-free graphs

math.CO

Perfect divisibility and 2-divisibility

A graph $G$ is said to be $2$-divisible if for all (nonempty) induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A,B$ such that $ω(A) < ω(H)$ and $ω(B) < ω(H)$. A graph $G$ is said to be perfectly divisible if for all induced subgraphs $H$ of $G$, $V(H)$ can be partitioned into two sets $A,B$ such that $H[A]$ is perfect and $ω(B) < ω(H)$. We prove that if a graph is $(P_5,C_5)$-free, then it is $2$-divisible. We also prove that if a graph is bull-free and either odd-hole-free or $P_5$-free, then it is perfectly divisible.

math.CO

Odd holes in bull-free graphs

The complexity of testing whether a graph contains an induced odd cycle of length at least five is currently unknown. In this paper we show that this can be done in polynomial time if the input graph has no induced subgraph isomorphic to the bull (a triangle with two disjoint pendant edges).

math.CO

Some problems on induced subgraphs

We discuss some problems related to induced subgraphs. The first problem is about getting a good upper bound for the chromatic number in terms of the clique number for graphs in which every induced cycle has length $3$ or $4$. The second problem is about the perfect chromatic number of a graph, which is the smallest number of perfect sets into which the vertex set of a graph can be partitioned. (A set of vertices is said to be perfect it it induces a perfect graph.) The third problem is on antichains in the induced subgraph ordering. The fourth problem is on graphs in which the difference between the chromatic number and the clique number is at most one for every induced subgraph of the graph. The fifth problem is on a weakening of the notorious Erdős-Hajnal conjecture. The last problem is on a conjecture of Gyárfás about $χ$-boundedness of a particular class of graphs.

math.CO