Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Sivaraman, Vaidy"'
Autor:
Singh, Jagdeep, Sivaraman, Vaidy
We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We prove that
Externí odkaz:
http://arxiv.org/abs/2403.15496
Autor:
Singh, Jagdeep, Sivaraman, Vaidy
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 pro
Externí odkaz:
http://arxiv.org/abs/2403.09456
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 he
Externí odkaz:
http://arxiv.org/abs/2310.02551
Autor:
Sivaraman, Vaidy, Whitman, Rebecca
Nordhaus and Gaddum proved in 1956 that the sum of the chromatic number $\chi$ 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.
Externí odkaz:
http://arxiv.org/abs/2310.02336
Autor:
Sivaraman, Vaidy, Zaslavsky, Thomas
Publikováno v:
Discrete Math., 345 (2022), article 112797, 3 pp
If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
Comment: 4 pp
Comment: 4 pp
Externí odkaz:
http://arxiv.org/abs/2106.10368
For a graph $G$, $\chi(G)$ will denote its chromatic number, and $\omega(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]$ i
Externí odkaz:
http://arxiv.org/abs/2104.02807
Autor:
Sivaraman, Vaidy, Slilaty, Daniel
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.
Externí odkaz:
http://arxiv.org/abs/2012.11712
Autor:
Sivaraman, Vaidy
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 the
Externí odkaz:
http://arxiv.org/abs/2001.00477
Autor:
Sivaraman, Vaidy, Testa, Stephen
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$.
Externí odkaz:
http://arxiv.org/abs/1903.11484
Autor:
Sivaraman, Vaidy
We adapt the Gy\'{a}rf\'{a}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.
Externí odkaz:
http://arxiv.org/abs/1903.01338