Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Seamone, Ben"'
Autor:
Devvrit, Fnu, Krim-Yee, Aaron, Kumar, Nithish, MacGillivray, Gary, Seamone, Ben, Virgile, Virgélot, Xu, AnQi
This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows and linear programming in order to obtain results on the complexity of d
Externí odkaz:
http://arxiv.org/abs/2304.11795
This paper studies two variants of defective acyclic coloring of planar graphs. For a graph $G$ and a coloring $\varphi$ of $G$, a 2CC transversal is a subset $E'$ of $E(G)$ that intersects every 2-colored cycle. Let $k$ be a positive integer. We den
Externí odkaz:
http://arxiv.org/abs/2301.11577
We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results from [Exp
Externí odkaz:
http://arxiv.org/abs/2211.08105
We show that there is a constant C such that for any $b<\frac{n}{\ln{n}}-\frac{Cn}{(\ln{n})^{3/2}}$, Maker wins the Maker-Breaker Hamilton cycle game in $n+\frac{Cn}{\sqrt{\ln{n}}}$ steps.
Comment: 11 pages
Comment: 11 pages
Externí odkaz:
http://arxiv.org/abs/2012.04302
We show that Maker wins the Maker-Breaker perfect matching game in $\frac{n}{2}+o(n)$ turns when the bias is at least $\frac{n}{\log{n}}-\frac{f(n)n}{(\log{n})^{5/4}}$, for any $f$ going to infinity with $n$ and $n$ sufficiently large (in terms of $f
Externí odkaz:
http://arxiv.org/abs/2012.04289
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 24, no 2, Graph Theory (August 22, 2022) dmtcs:6700
Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed. In par
Externí odkaz:
http://arxiv.org/abs/2007.07464
Autor:
Gagnon, Alizée, Hassler, Alexander, Huang, Jerry, Krim-Yee, Aaron, Inerney, Fionn Mc, Zacarías, Andrés, Seamone, Ben, Virgile, Virgélot
In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex. The go
Externí odkaz:
http://arxiv.org/abs/2003.01495
An eternal dominating set of a graph $G$ is a set of vertices (or "guards") which dominates $G$ and which can defend any infinite series of vertex attacks, where an attack is defended by moving one guard along an edge from its current position to the
Externí odkaz:
http://arxiv.org/abs/1902.00799
Publikováno v:
In Discrete Applied Mathematics 15 June 2023 332:23-40
Autor:
Khatri, Devvrit, Komarov, Natasha, Krim-Yee, Aaron, Kumar, Nithish, Seamone, Ben, Virgile, Virgélot, Xu, AnQi
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between the cop numbers of an oriented graph and its underlying undirected gra
Externí odkaz:
http://arxiv.org/abs/1811.06155