Obligatory subsystems of triple systems
From MaRDI portal
The paper studies unavoidable configurations in triple systems with uncountable chromatic number, and with no two triples intersecting by 2 points. It is proved that every unavoidable subsystem is tripartite, and can be realised as the collection of rainbow-colored triangles in a finite 3-edge-colored graph. An infinite series of unavoidable systems is found.
Recommendations
- Kirkman triple systems with subsystems
- scientific article; zbMATH DE number 4112599
- Some remarks on obligatory subsystems of uncountably chromatic triple systems
- scientific article; zbMATH DE number 5130670
- scientific article; zbMATH DE number 1314686
- scientific article; zbMATH DE number 3855116
- scientific article; zbMATH DE number 4079439
- Triple systems with composition forms
- Some Structure Theory for a Class of Triple Systems
Cites work
- A partition calculus in set theory
- Graph Theory and Probability
- scientific article; zbMATH DE number 3506706 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- Partition Relations Connected with the Chromatic Number of Graphs
- Some remarks on obligatory subsystems of uncountably chromatic triple systems
Cited in
(3)
This page was built for publication: Obligatory subsystems of triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949814)
