10 citations · 14 across the 14 of their papers we have counts for
4 papers · 1 filter
No additional tournaments are quasirandom-forcing
Robert Hancock, Adam Kabela, Daniel Kral +4
A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density…
Packing and covering directed triangles asymptotically
Jacob W. Cooper, Andrzej Grzesik, Adam Kabela +1
A well-known conjecture of Tuza asserts that if a graph has at most pairwise edge-disjoint triangles, then it can be made triangle-free by removing at most edges. If true,…
Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs
Adam Kabela, Zdeněk Ryjáček, Petr Vrána
We continue studying Thomassen's conjecture (every 4-connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2-…
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
Christoph Brause, Přemysl Holub, Adam Kabela +3
Considering connected -free graphs with independence number at least , Chudnovsky and Seymour (2010) showed that every such graph, say , is -colourable where …