Packing nearly-disjoint sets

DOI10.1007/BF02579285zbMath0494.05015MaRDI QIDQ1168975

P. D. Seymour

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

projective planenearly-disjoint collection of sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Permutations, words, matrices (05A05) Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40)

Related Items (12)

Multicolored lines in a finite geometry ⋮ Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ A method of finding automorphism groups of endomorphism monoids of relational systems. ⋮ 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 ⋮ A sharpening of Fisher's inequality ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ A fractional version of the Erdős-Faber-Lovász conjecture ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The chromatic index of simple hypergraphs

Cites Work

• On the Size of Partial Parallel Classes in Steiner Systems
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings

This page was built for publication: Packing nearly-disjoint sets