A fractional version of the Erdős-Faber-Lovász conjecture

DOI10.1007/BF01204719zbMath0774.05072WikidataQ56390954 ScholiaQ56390954MaRDI QIDQ1196685

P. D. Seymour, Jeffry Kahn

Publication date: 16 January 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

hypergraphmatchingsErdős-Faber-Lovász conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items

A problem of Füredi and Seymour on covering intersecting families by pairs, ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE, A note on fractional covers of a graph, 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, The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited, Graph theory. Abstracts from the workshop held January 2--8, 2022, Unnamed Item, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Fractional aspects of the Erdős-Faber-Lovász conjecture, On topological relaxations of chromatic conjectures, Two Chromatic Conjectures: One for Vertices and One for Edges, The Erdős–Faber–Lovász conjecture for the class of δEFL graphs, A counterexample to Borsuk’s conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• The chromatic index of simple hypergraphs
• On the combinatorial problems which I would most like to see solved
• Packing nearly-disjoint sets
• Matchings and covers in hypergraphs
• The Lines and Planes Connecting the Points of a Finite Set