2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2022★ 2 cited
The Turán density of tight cycles in three-uniform hypergraphs
Nina Kamčev, Shoham Letzter, Alexey Pokrovskiy
The Turán density of an -uniform hypergraph , denoted , is the limit of the maximum density of an -vertex -uniform hypergraph not containing a…
math.CO2020★ 1 cited
Asymptotic enumeration of hypergraphs by degree sequence
Nina Kamčev, Anita Liebenau, Nick Wormald
We prove an asymptotic formula for the number of -uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asym…
math.CO2019
The Kőnig Graph Process
Nina Kamčev, Michael Krivelevich, Natasha Morrison +1
Say that a graph G has property if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set $N:= \binom{n…