Edge‐coloring linear hypergraphs with medium‐sized edges

DOI10.1002/rsa.20843zbMath1423.05066arXiv1707.08372OpenAlexW2918512158MaRDI QIDQ5236928

Vance Faber, David G. Harris

Publication date: 16 October 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.08372

zbMATH Keywords

linear hypergraphchromatic indexEFL

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (5)

Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Coloring graphs with sparse neighborhoods
• Asymptotically good list-colorings
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs

This page was built for publication: Edge‐coloring linear hypergraphs with medium‐sized edges