The following pages link to Packing nearly-disjoint sets (Q1168975):
Displaying 12 items.
- A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337) (← links)
- The chromatic index of simple hypergraphs (Q1073804) (← links)
- Multicolored lines in a finite geometry (Q1112829) (← links)
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
- A sharpening of Fisher's inequality (Q1175982) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
