Pages that link to "Item:Q1092067"
From MaRDI portal
The following pages link to Near perfect coverings in graphs and hypergraphs (Q1092067):
Displaying 11 items.
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- Tuza's conjecture for random graphs (Q6076736) (← links)
- Realization of digraphs in Abelian groups and its consequences (Q6081565) (← links)
- Improved bound on vertex degree version of Erdős matching conjecture (Q6081573) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Combining subspace codes (Q6112253) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- Path-monochromatic bounded depth rooted trees in (random) tournaments (Q6494953) (← links)
- On the \((6,4)\)-problem of Brown, Erdős, and Sós (Q6562822) (← links)
- A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
- Approximate generalized Steiner systems and near-optimal constant weight codes (Q6637139) (← links)
