Y. Kohayakawa

most citedLimits of permutation sequences through permutation regularity

27 citations · 29 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2011

The chromatic thresholds of graphs

Peter Allen, Julia Böttcher, Simon Griffiths +2

The chromatic threshold delta_chi(H) of a graph H is the infimum of d>0 such that there exists C=C(H,d) for which every H-free graph G with minimum degree at least d|G| satisfies c…

math.CO2011★ 27 cited

Limits of permutation sequences through permutation regularity

Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo Tamm de Araújo Moreira +1

A permutation sequence $(σ_{n})_{n \in N}$ is said to be convergent if, for every fixed permutation $τ$ , the density of occurrences of $τ$ in the elements of the sequence co…

math.CO2011★ 2 cited

Hypergraphs with many Kneser colorings (Extended Version)

Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann

For fixed positive integers $r, k$ and $ℓ$ with $1 \leq ℓ < r$ and an $r$ -uniform hypergraph $H$ , let $κ (H, k, ℓ)$ denote the number of $k$ -colorings of the set of hyperedg…