Pages that link to "Item:Q2785566"
From MaRDI portal
The following pages link to On some hypergraph problems of Paul Erdös and the asymptotics of matchings, covers and colorings (Q2785566):
Displaying 6 items.
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Asymptotics of the list-chromatic index for multigraphs (Q4511485) (← 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)