5 citations · 8 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 5 cited
Tournament quasirandomness from local counting
M. Bucić, E. Long, A. Shapira +1
A well-known theorem of Chung and Graham states that if then a tournament is quasirandom if and only if contains each -vertex tournament the "correct number" o…
math.CO2019
2-factors with k cycles in Hamiltonian graphs
Matija Bucić, Erik Jahn, Alexey Pokrovskiy +1
A well known generalisation of Dirac's theorem states that if a graph on vertices has minimum degree at least then contains a -factor consisting of exact…