Embedding hypertrees into steiner triple systems

DOI10.1002/JCD.21641zbMath1407.05034arXiv1804.08191OpenAlexW2798345498MaRDI QIDQ4629524

Bradley Elliott, Vojtěch Rödl

Publication date: 27 March 2019

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.08191

zbMATH Keywords

hypergraphSteiner triple system

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Triple systems (05B07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Every Steiner triple system contains almost spanning \(d\)-ary hypertree ⋮ Colorful Matchings ⋮ Linear Turán numbers of acyclic triple systems

This page was built for publication: Embedding hypertrees into steiner triple systems