A note on embedding hypertrees
From MaRDI portal
Publication:1028812
zbMath1188.05049arXiv0901.2988MaRDI QIDQ1028812
Publication date: 8 July 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.2988
Related Items (9)
List coloring triangle-free hypergraphs ⋮ Trees in greedy colorings of hypergraphs ⋮ Independent sets in hypergraphs omitting an intersection ⋮ Extremal problems in hypergraph colourings ⋮ Unnamed Item ⋮ Constructive Methods in Gallai-Ramsey Theory for Hypergraphs ⋮ Coloring H-free hypergraphs ⋮ Chromatic Ramsey number of acyclic hypergraphs ⋮ Trees and $n$-Good Hypergraphs
This page was built for publication: A note on embedding hypertrees