The following pages link to A note on embedding hypertrees (Q1028812):
Displaying 9 items.
- Trees in greedy colorings of hypergraphs (Q616002) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- List coloring triangle-free hypergraphs (Q3452728) (← links)
- Trees and $n$-Good Hypergraphs (Q4622621) (← links)
- (Q5042419) (← links)
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs (Q5109420) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Independent sets in hypergraphs omitting an intersection (Q6052482) (← links)
