Linear Hypergraph Edge Coloring
Vance Faber
TL;DR
This paper investigates edge coloring in linear hypergraphs, expanding the class of hypergraphs for which the Erdos-Faber-Lovasz conjecture holds, thereby advancing understanding in hypergraph coloring theory.
Contribution
It extends the class of linear hypergraphs validated by the Erdos-Faber-Lovasz conjecture, providing new insights into hypergraph edge coloring.
Findings
Increased class of hypergraphs satisfying EFL
Established relationships between hypergraph coloring conjectures
Enhanced understanding of linear hypergraph properties
Abstract
Motivated by the Erdos-Faber Lovasz conjecture (EFL) for hypergraphs, we explore relationships between several conjectures on the edge coloring of linear hypergraphs. In particular, we are able to increase the class of hypergraphs for which EFL is true.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory