On the minimum size of 4-uniform hypergraphs without property B

Patric R.J. Östergård

doi:10.1016/j.dam.2011.11.035

On the minimum size of 4-uniform hypergraphs without property B

Patric R.J. Östergård

Information Theory

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

8 Citations (Scopus)

Original language	English
Pages (from-to)	199-204
Journal	Discrete Applied Mathematics
Volume	163
Issue number	2
DOIs	https://doi.org/10.1016/j.dam.2011.11.035
Publication status	Published - 2014
MoE publication type	A1 Journal article-refereed

Keywords

coloring
graph
hypergraph

Access to Document

10.1016/j.dam.2011.11.035

OpenUrl availability

Full text

Cite this

@article{db05eca1e7044254b9aab89cdc92b355,

title = "On the minimum size of 4-uniform hypergraphs without property B",

keywords = "coloring, graph, hypergraph, coloring, graph, hypergraph, coloring, graph, hypergraph",

author = "{\"O}sterg{\aa}rd, {Patric R.J.}",

year = "2014",

doi = "10.1016/j.dam.2011.11.035",

language = "English",

volume = "163",

pages = "199--204",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - On the minimum size of 4-uniform hypergraphs without property B

AU - Östergård, Patric R.J.

PY - 2014

Y1 - 2014

KW - coloring

KW - graph

KW - hypergraph

KW - coloring

KW - graph

KW - hypergraph

KW - coloring

KW - graph

KW - hypergraph

U2 - 10.1016/j.dam.2011.11.035

DO - 10.1016/j.dam.2011.11.035

M3 - Article

VL - 163

SP - 199

EP - 204

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -