Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large

Victor Falgas-Ravry; Allan Lo

Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large

Victor Falgas-Ravry, Allan Lo

Mathematics

Research output: Contribution to journal › Article › peer-review

36 Downloads (Pure)

Abstract

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 ℓ-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

Access to Document

Falgas-Ravry_Lo_Subgraphs_with_large_minimum_Electronic_Journal_CombinatoricsFinal published version, 259 KBLicence: None: All rights reserved

http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p18Licence: None: All rights reserved

A graph theoretical approach for combinatorial designs
Lo, A.
Engineering & Physical Science Research Council
1/11/16 → 31/10/18
Project: Research Councils

Cite this

@article{199d36b6ac4f4ca5a7b30b635b75bc03,

title = "Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large",

abstract = "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 ℓ-degree. ",

keywords = "math.CO, 05C65, 05D99",

author = "Victor Falgas-Ravry and Allan Lo",

year = "2018",

month = apr,

day = "27",

language = "English",

volume = "25",

journal = "The Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2",

}

TY - JOUR

T1 - Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large

AU - Falgas-Ravry, Victor

AU - Lo, Allan

PY - 2018/4/27

Y1 - 2018/4/27

N2 - 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 ℓ-degree.

AB - 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 ℓ-degree.

KW - math.CO

KW - 05C65, 05D99

M3 - Article

SN - 1077-8926

VL - 25

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

IS - 2

M1 - P2.18

ER -

Subgraphs with large minimum ℓ-degree in hypergraphs where almost all ℓ-degrees are large

Abstract

Keywords

Access to Document

Fingerprint

Projects

A graph theoretical approach for combinatorial designs

Cite this