Pages that link to "Item:Q2411628"
From MaRDI portal
The following pages link to Monochromatic tree covers and Ramsey numbers for set-coloured graphs (Q2411628):
Displaying 6 items.
- On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs (Q1691092) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)
- Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited (Q6188119) (← links)
- The power of many colours (Q6652256) (← links)
