Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Dense uniform hypergraphs have high list chromatic number

From MaRDI portal
Publication:432708
Jump to:navigation, search

DOI10.1016/J.DISC.2011.05.013zbMath1244.05156OpenAlexW2023072337MaRDI QIDQ432708

Noga Alon, Alexandr V. Kostochka

Publication date: 4 July 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.013


zbMATH Keywords

hypergraphlist coloringco-degree


Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)


Related Items (4)

Online containers for hypergraphs, with applications to linear equations ⋮ Hypergraph containers ⋮ On the Choice Number of Packings ⋮ List colorings of multipartite hypergraphs




Cites Work

  • The choice number of random bipartite graphs
  • List coloring hypergraphs
  • Hypergraph list coloring and Euclidean Ramsey theory
  • On list coloring Steiner triple systems
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Dense uniform hypergraphs have high list chromatic number

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:432708&oldid=12307075"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki