The size of minimum 3-trees

DOI10.1002/JGT.20197MaRDI QIDQ3422128zbMATH OpenOpenAlexFDO

Authors Joaquín Tey, Jorge L. Arocha

Publication date 9 February 2007

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20197

zbMATH Keywords

tight hypergraphstriangulated surfacestriple systems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65)

Recommendations

• The size of minimum 3-trees: cases 0 and 1 mod 12
• The size of minimum 3-trees: Cases 3 and 4 mod 6
• The size of minimum 3-trees: Case 2 mod 3
• On the minimum size of tight hypergraphs
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph

Cites work

• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• The size of minimum 3-trees: cases 0 and 1 mod 12

Cited in

(11)

• Forcing large tight components in 3-graphs
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
• Irredundance trees of diameter 3
• Small cores in 3-uniform hypergraphs
• On the minimum size of tight hypergraphs
• Maximum number of colors: C-coloring and related problems
• The size of minimum 3-trees: Cases 3 and 4 mod 6
• The size of minimum 3-trees: cases 0 and 1 mod 12
• Almost all triangle-free triple systems are tripartite
• The size of minimum 3-trees: Case 2 mod 3
• Smallest set-transversals of \(k\)-partitions

This page was built for publication: The size of minimum 3-trees

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