Geodesic
Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
Victor Falgas-Ravry1 ; Allan Lo2
1Umeå Universitet
2University of Birmingham
The electronic journal of combinatorics, Tome 25 (2018) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $G$ be an $r$-uniform 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 $\ell$-degree.
DOI : 10.37236/6553
Classification : 05C65, 05C35, 05C07
Mots-clés : hypergraphs, \(\ell\)-degree, extremal hypergraph theory

Victor Falgas-Ravry  1   ; Allan Lo  2

1 Umeå Universitet
2 University of Birmingham 
@article{10_37236_6553,
     author = {Victor Falgas-Ravry and Allan Lo},
     title = {Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {2},
     doi = {10.37236/6553},
     zbl = {1387.05171},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6553/}
}
TY  - JOUR
AU  - Victor Falgas-Ravry
AU  - Allan Lo
TI  - Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6553/
DO  - 10.37236/6553
ID  - 10_37236_6553
ER  - 
%0 Journal Article
%A Victor Falgas-Ravry
%A Allan Lo
%T Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/6553/
%R 10.37236/6553
%F 10_37236_6553
Victor Falgas-Ravry; Allan Lo. Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large. The electronic journal of combinatorics, Tome 25 (2018) no. 2. doi: 10.37236/6553

Cité par Sources :