Title
Subgraphs with Large Minimum $\ell$-Degree in Hypergraphs where Almost All $\ell$-Degrees are Large.
Abstract
Let G be an r-uniform hypergraph on n vertices such that all but at most e(n l) l-subsets of vertices have degree at least p(n-l r-l). We show that G contains a large subgraph with high minimum l-d ...
Year
Venue
Field
2018
Electr. J. Comb.
Discrete mathematics,Combinatorics,Vertex (geometry),Hypergraph,Constraint graph,Mathematics
DocType
Volume
Issue
Journal
25
2
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Victor Falgas-Ravry1287.46
Allan Lo213815.66