Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Casey Tompkins"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 1, ICGT 2018 (2019)
Generalizing Tur\'an's classical extremal problem, Alon and Shikhelman investigated the problem of maximizing the number of $T$ copies in an $H$-free graph, for a pair of graphs $T$ and $H$. Whereas Alon and Shikhelman were primarily interested in de
Externí odkaz:
https://doaj.org/article/38423f730f254b90be23c728947a55c1
Publikováno v:
Discrete Mathematics. 346:113286
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02868c4a7a5c407df5e8545fd9175ec9
https://doi.org/10.1016/j.disc.2022.113286
https://doi.org/10.1016/j.disc.2022.113286
Publikováno v:
Journal of Graph Theory. 97:34-46
For a bipartite graph G, let h(G) be the largest t such that either G or the bipartite complement of G contain K$_{t,t}$. For a class F of graphs, let h(F)= min {h(G): G\in F}. We say that a bipartite graph H is strongly acyclic if neither H nor its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c64bceadc7ac74287dafe0f9c9c14353
https://doi.org/10.1002/jgt.22639
https://doi.org/10.1002/jgt.22639
Publikováno v:
Combinatorics, Probability and Computing. 29:436-454
Let c denote the largest constant such that every C6-free graph G contains a bipartite and C4-free subgraph having a fraction c of edges of G. Győri, Kensell and Tompkins showed that 3/8 ⩽ c ⩽ 2/5. We prove that c = 38. More generally, we show t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac8f5880b225aaf3361450aa1583f6d6
https://doi.org/10.1017/s0963548319000452
https://doi.org/10.1017/s0963548319000452
Publikováno v:
The Electronic Journal of Combinatorics. 28
In a generalized Turán problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $n$-vertex graph not containing $F$ as a subgraph. We consider generalized Turán problems where the host graph is planar. In part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac86b95b20f76269d1a810f9e44765fe
https://doi.org/10.37236/9603
https://doi.org/10.37236/9603
Publikováno v:
Combinatorics, Probability and Computing. 29:423-435
The maximum size of an r-uniform hypergraph without a Berge cycle of length at least k has been determined for all k ≥ r + 3 by Füredi, Kostochka and Luo and for k < r (and k = r, asymptotically) by Kostochka and Luo. In this paper we settle the r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a1fc526db7fc6fcd87ee99403f2ed1e
https://doi.org/10.1017/s0963548319000415
https://doi.org/10.1017/s0963548319000415
Publikováno v:
Graphs and Combinatorics. 35:689-694
While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on $$P_k$$ -free graphs. They proved that any graph G with a proper vertex coloring and no path of length $$2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d20e98359913646bdaa6bb62d5a8950b
https://doi.org/10.1007/s00373-019-02026-1
https://doi.org/10.1007/s00373-019-02026-1
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6f4736bc7336ad4292c42ddde3957a8
https://doi.org/10.1007/978-3-030-83823-2_41
https://doi.org/10.1007/978-3-030-83823-2_41
Publikováno v:
European journal of combinatorics, 95, Art. Nr.: 103320
We consider edge decompositions of the n -dimensional hypercube Q n into isomorphic copies of a given graph H . While a number of results are known about decomposing Q n into graphs from various classes, the simplest cases of paths and cycles of a gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68ea61cd32581af648cc8dec8d5690f0
Publikováno v:
Discrete Mathematics. 345:112779
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3711ab7013ed28ac0e11d71f43c6efc5
https://doi.org/10.1016/j.disc.2021.112779
https://doi.org/10.1016/j.disc.2021.112779