Triple systems are Eulerian

DOI10.1002/JCD.21536MaRDI QIDQ5346576zbMATH OpenOpenAlexFDO

Authors Mateja Šajna, Andrew Wagner

Publication date 26 May 2017

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

Full work available at URL https://doi.org/10.1002/jcd.21536

zbMATH Keywords

1-overlap cycleEuler familyEuler tourEulerian hypergraphrank-2 universal cycletriple system

Mathematics Subject Classification ID

Triple systems (05B07) Hypergraphs (05C65)

Recommendations

• Covering hypergraphs are Eulerian
• scientific article; zbMATH DE number 3896973
• Quasi-Eulerian hypergraphs
• On tours that contain all edges of a hypergraph
• scientific article; zbMATH DE number 3931027

Cites work

• 1-overlap cycles for Steiner triple systems
• Graph theory with applications
• On tours that contain all edges of a hypergraph
• Ordering block designs. Gray codes, universal cycles and configuration orderings

Cited in

(6)

• Quasi-Eulerian hypergraphs
• Euler tours in hypergraphs
• scientific article; zbMATH DE number 3931027 (Why is no real title available?)
• Covering hypergraphs are Eulerian
• -covering k-hypergraphs are quasi-Eulerian
• Spanning Euler tours in hypergraphs

This page was built for publication: Triple systems are Eulerian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346576)