Projects per year
Abstract
Let G be an runiform hypergraph on n vertices such that all but at most $\varepsilon \binom{n}{\ell}$ $\ell$subsets of vertices have degree at least $p \binom{n\ell}{r\ell}$. We show that G contains a large subgraph with high minimum ℓdegree.
Original language  English 

Article number  P2.18 
Journal  The Electronic Journal of Combinatorics 
Volume  25 
Issue number  2 
Publication status  Published  27 Apr 2018 
Keywords
 math.CO
 05C65, 05D99
Fingerprint
Dive into the research topics of 'Subgraphs with large minimum ℓdegree in hypergraphs where almost all ℓdegrees are large'. Together they form a unique fingerprint.Projects
 1 Finished

A graph theoretical approach for combinatorial designs
ENGINEERING & PHYSICAL SCIENCE RESEARCH COUNCIL
1/11/16 → 31/10/18
Project: Research Councils