Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Yeager, Elyse"'
In 1963, Corr\'adi and Hajnal settled a conjecture of Erd\H{o}s by proving that, for all $k \geq 1$, any graph $G$ with $|G| \geq 3k$ and minimum degree at least $2k$ contains $k$ vertex-disjoint cycles. In 2008, Finkel proved that for all $k \geq 1$
Externí odkaz:
http://arxiv.org/abs/1511.04356
Given graphs $G$ and $H$, $G$ is $H$-saturated if $H$ is not a subgraph of $G$, but for all $e \notin E(G)$, $H$ appears as a subgraph of $G + e$. While for every $n \ge |V(H)|$, there exists an $n$-vertex graph that is $H$-saturated, the same does n
Externí odkaz:
http://arxiv.org/abs/1503.02105
Publikováno v:
In Discrete Mathematics June 2020 343(6)
Autor:
Reiniger, Benjamin, Yeager, Elyse
Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$-element poset. A lower bound of order $\sqrt{n}$ was found by Goodwillie. We provide a sublinear upper bound for each $d$. For $d=2$, our bound is $n^{0.8295}$.
C
C
Externí odkaz:
http://arxiv.org/abs/1404.0021
Publikováno v:
Discrete Math., 332:10-14, 2014
Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some $k$ such that all $k$th power graphs are chromatic-choosable. We answer this question in the negative: we
Externí odkaz:
http://arxiv.org/abs/1309.7705
Autor:
Diemunsch, Jennifer, Furuya, Michitaka, Sharifzadeh, Maryam, Tsuchiya, Shoichi, Wang, David, Wise, Jennifer, Yeager, Elyse
Publikováno v:
In Discrete Applied Mathematics 20 April 2015 185:71-78
Publikováno v:
In Discrete Mathematics 6 May 2014 322:26-30
Publikováno v:
Graphs & Combinatorics; Jan2017, Vol. 33 Issue 1, p181-201, 21p
Publikováno v:
In Discrete Mathematics 6 October 2014 332:10-14