Asymptotic sharpness of bounds on hypertrees

DOI10.7151/DMGT.1947MaRDI QIDQ2364096zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 17 July 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1947

zbMATH Keywords

chain in hypergraphhypertreesemicycle in hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
• Bounds on the number of edges in hypertrees
• scientific article; zbMATH DE number 123394
• Hypergraphs not containing a tight tree with a bounded trunk
• Hypertrees

Cites work

• Bounds on the number of edges in hypertrees
• Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
• Decorated hypertrees
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• Hypertrees

Cited in

(8)

• Ordered \(h\)-hypertrees
• Forestation in hypergraphs: Linear \(k\)-trees
• A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
• Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
• Bounds on the number of edges in hypertrees
• Asymptotic results on Hoppe trees and their variations
• scientific article; zbMATH DE number 123394 (Why is no real title available?)
• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems

This page was built for publication: Asymptotic sharpness of bounds on hypertrees

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