Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Culver, Eric"'
Autor:
Buchanan, Calum, Clifton, Alexander, Culver, Eric, Frankl, Péter, Nie, Jiaxi, Ozeki, Kenta, Rombach, Puck, Yin, Mei
Babai and Frankl posed the ``odd cover problem" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order $n$ is covered an odd number of times. In a previous paper with O'Neil
Externí odkaz:
http://arxiv.org/abs/2408.08598
Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order $n$ is at most $\lceil \frac13 n \rceil$, the domination number of cubic graphs has been extensively studied. It is now known that the conjecture is false i
Externí odkaz:
http://arxiv.org/abs/2312.03384
Autor:
Borgwardt, Steffen, Buchanan, Calum, Culver, Eric, Frederickson, Bryce, Rombach, Puck, Yoo, Youngho
We introduce and study "path odd-covers", a weakening of Gallai's path decomposition problem and a strengthening of the linear arboricity problem. The "path odd-cover number" $p_2(G)$ of a graph $G$ is the minimum cardinality of a collection of paths
Externí odkaz:
http://arxiv.org/abs/2306.06487
Autor:
Culver, Eric, Hartke, Stephen G.
We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12. Keywords: planar graph, choosability AMS Mathematics Subject Classification: 05C15
Comment: 16 pages, 24 figures
Comment: 16 pages, 24 figures
Externí odkaz:
http://arxiv.org/abs/2210.13618
Autor:
Bang, Caroline, von Bell, Matias, Culver, Eric, Dickson, Jessica, Dimitrov, Stoyan, Perrier, Rachel, Sundaram, Sheila
Publikováno v:
J. Integer Seq. 26 (2023), no. 2, Art. 23.2.7, 40 pp
We study three operations on Riordan arrays. First, we investigate when the sum of Riordan arrays yields another Riordan array. We characterize the $A$- and $Z$-sequences of these sums of Riordan arrays, and also identify an analog for $A$-sequences
Externí odkaz:
http://arxiv.org/abs/2210.02566
Autor:
Culver, Eric, Hartke, Stephen
We study the relation between the correspondence chromatic number and the Alon--Tarsi number, both upper bounds on the list chromatic number of a graph. There are many graphs with Alon--Tarsi number greater than the correspondence chromatic number. W
Externí odkaz:
http://arxiv.org/abs/2206.11964
Autor:
Buchanan, Calum, Clifton, Alexander, Culver, Eric, Nie, Jiaxi, O'Neill, Jason, Rombach, Puck, Yin, Mei
Given a finite simple graph $G$, an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and each non-edge of $G$ appears in an even number of bicliques. We denot
Externí odkaz:
http://arxiv.org/abs/2202.09822
The R\'{e}nyi $\alpha$-entropy $H_{\alpha}$ of complete antisymmetric directed graphs (i.e., tournaments) is explored. We optimize $H_{\alpha}$ when $\alpha = 2$ and $3$, and find that as $\alpha$ increases $H_{\alpha}$'s sensitivity to what we refer
Externí odkaz:
http://arxiv.org/abs/1812.09458
Publikováno v:
In Linear Algebra and Its Applications 1 January 2020 584:371-393
