The size of minimum 3-trees: cases 0 and 1 mod 12

DOI10.7151/DMGT.1194zbMATH Open1038.05040OpenAlexW2071586097MaRDI QIDQ4458979FDOQ4458979

Authors: Joaquín Tey, Jorge L. Arocha 

Publication date: 25 March 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2d65e6205d140d2d1ee4c27d33c7717bcd90457a

Recommendations

• The size of minimum 3-trees
• The size of minimum 3-trees: Cases 3 and 4 mod 6
• The size of minimum 3-trees: Case 2 mod 3
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
• On the minimum size of tight hypergraphs

zbMATH Keywords

3-uniform hypergraphrainbow coloring

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Triple systems (05B07)

Cited In (3)

• On the minimum size of tight hypergraphs
• The size of minimum 3-trees: Case 2 mod 3
• The size of minimum 3-trees

This page was built for publication: The size of minimum 3-trees: cases 0 and 1 mod 12

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