Color critical hypergraphs with many edges

V. Rödl; M. Siggers

doi:10.1002/jgt.20166

Color critical hypergraphs with many edges

V. Rödl, M. Siggers

Emory University

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

5 Scopus citations

Abstract

We show that for all k ≥ 3, r > l ≥ 2 there exists constant c = c(/c, r, l) such that for large enough n there exists a k-color-critical r-uniform hypergraph on less than n vertices, having more than cn′ edges, and having no l-set of vertices occuring in more than one edge.

Original language	English
Pages (from-to)	56-74
Number of pages	19
Journal	Journal of Graph Theory
Volume	53
Issue number	1
DOIs	https://doi.org/10.1002/jgt.20166
State	Published - Sep 2006

Keywords

Color critical dense hypergraph
Minimal partial steiner system

Access to Document

10.1002/jgt.20166

Cite this

@article{d4b49df132f64a4a8321ee7d16156c6c,

title = "Color critical hypergraphs with many edges",

abstract = "We show that for all k ≥ 3, r > l ≥ 2 there exists constant c = c(/c, r, l) such that for large enough n there exists a k-color-critical r-uniform hypergraph on less than n vertices, having more than cn′ edges, and having no l-set of vertices occuring in more than one edge.",

keywords = "Color critical dense hypergraph, Minimal partial steiner system",

author = "V. R{\"o}dl and M. Siggers",

year = "2006",

month = sep,

doi = "10.1002/jgt.20166",

language = "English",

volume = "53",

pages = "56--74",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "1",

}

TY - JOUR

T1 - Color critical hypergraphs with many edges

AU - Rödl, V.

AU - Siggers, M.

PY - 2006/9

Y1 - 2006/9

N2 - We show that for all k ≥ 3, r > l ≥ 2 there exists constant c = c(/c, r, l) such that for large enough n there exists a k-color-critical r-uniform hypergraph on less than n vertices, having more than cn′ edges, and having no l-set of vertices occuring in more than one edge.

AB - We show that for all k ≥ 3, r > l ≥ 2 there exists constant c = c(/c, r, l) such that for large enough n there exists a k-color-critical r-uniform hypergraph on less than n vertices, having more than cn′ edges, and having no l-set of vertices occuring in more than one edge.

KW - Color critical dense hypergraph

KW - Minimal partial steiner system

UR - http://www.scopus.com/inward/record.url?scp=33748476054&partnerID=8YFLogxK

U2 - 10.1002/jgt.20166

DO - 10.1002/jgt.20166

M3 - Article

AN - SCOPUS:33748476054

SN - 0364-9024

VL - 53

SP - 56

EP - 74

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 1

ER -

Color critical hypergraphs with many edges

Abstract

Keywords

Access to Document

Other files and links

Cite this