Packing nearly-disjoint sets

DOI10.1007/BF02579285MaRDI QIDQ1168975zbMATH OpenFDO

Authors Paul Seymour

Publication date 1982

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02579285

zbMATH Keywords

nearly-disjoint collection of setsprojective plane

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(12)

• The chromatic index of simple hypergraphs
• Multicolored lines in a finite geometry
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• 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
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Two Chromatic Conjectures: One for Vertices and One for Edges
• Graph and hypergraph colouring via nibble methods: a survey
• A proof of the Erdős-Faber-Lovász conjecture
• A method of finding automorphism groups of endomorphism monoids of relational systems.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168975)