Choosability with separation of complete multipartite graphs and hypergraphs

Z. Füredi, Alexandr Kostochka, Mohit Kumbhat

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

For a hypergraph G and a positive integer s, let χℓ(G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v-V(G) and |L(u)∩L(v)|≤s for all u,v-e-E(G). This parameter was studied by Kratochvíl, Tuza, and Voigt for various kinds of graphs. Using randomized constructions we find the asymptotics of χℓ(G,s) for balanced complete multipartite graphs and for complete k-partite k-uniform hypergraphs.

Original languageEnglish
Pages (from-to)129-137
Number of pages9
JournalJournal of Graph Theory
Volume76
Issue number2
DOIs
Publication statusPublished - 2014

Fingerprint

Choosability
Complete multipartite Graph
Uniform Hypergraph
Hypergraph
Integer
Graph in graph theory

Keywords

  • 05C15
  • hypergraphs
  • list coloring
  • multipartite graphs
  • separation

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Choosability with separation of complete multipartite graphs and hypergraphs. / Füredi, Z.; Kostochka, Alexandr; Kumbhat, Mohit.

In: Journal of Graph Theory, Vol. 76, No. 2, 2014, p. 129-137.

Research output: Contribution to journalArticle

Füredi, Z. ; Kostochka, Alexandr ; Kumbhat, Mohit. / Choosability with separation of complete multipartite graphs and hypergraphs. In: Journal of Graph Theory. 2014 ; Vol. 76, No. 2. pp. 129-137.
@article{5d594ab556b84cb3ab2f548ba44fe94b,
title = "Choosability with separation of complete multipartite graphs and hypergraphs",
abstract = "For a hypergraph G and a positive integer s, let χℓ(G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v-V(G) and |L(u)∩L(v)|≤s for all u,v-e-E(G). This parameter was studied by Kratochv{\'i}l, Tuza, and Voigt for various kinds of graphs. Using randomized constructions we find the asymptotics of χℓ(G,s) for balanced complete multipartite graphs and for complete k-partite k-uniform hypergraphs.",
keywords = "05C15, hypergraphs, list coloring, multipartite graphs, separation",
author = "Z. F{\"u}redi and Alexandr Kostochka and Mohit Kumbhat",
year = "2014",
doi = "10.1002/jgt.21754",
language = "English",
volume = "76",
pages = "129--137",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Choosability with separation of complete multipartite graphs and hypergraphs

AU - Füredi, Z.

AU - Kostochka, Alexandr

AU - Kumbhat, Mohit

PY - 2014

Y1 - 2014

N2 - For a hypergraph G and a positive integer s, let χℓ(G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v-V(G) and |L(u)∩L(v)|≤s for all u,v-e-E(G). This parameter was studied by Kratochvíl, Tuza, and Voigt for various kinds of graphs. Using randomized constructions we find the asymptotics of χℓ(G,s) for balanced complete multipartite graphs and for complete k-partite k-uniform hypergraphs.

AB - For a hypergraph G and a positive integer s, let χℓ(G,s) be the minimum value of l such that G is L-colorable from every list L with |L(v)|=l for each v-V(G) and |L(u)∩L(v)|≤s for all u,v-e-E(G). This parameter was studied by Kratochvíl, Tuza, and Voigt for various kinds of graphs. Using randomized constructions we find the asymptotics of χℓ(G,s) for balanced complete multipartite graphs and for complete k-partite k-uniform hypergraphs.

KW - 05C15

KW - hypergraphs

KW - list coloring

KW - multipartite graphs

KW - separation

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

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

U2 - 10.1002/jgt.21754

DO - 10.1002/jgt.21754

M3 - Article

AN - SCOPUS:84897570429

VL - 76

SP - 129

EP - 137

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -