High girth augmented trees are huge

DOI10.1016/J.JCTA.2016.06.004MaRDI QIDQ739384zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 18 August 2016

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2016.06.004

zbMATH Keywords

chromatic numberAckermann hierarchyhigh girth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Size of Graphs with High Girth
• On a conjecture about trees in graphs with large girth
• Girth and treewidth
• On the structure of extremal graphs of high girth
• Maximal cycles in graphs of large girth

Cites work

• scientific article; zbMATH DE number 5764800 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• Coloring, sparseness and girth
• Communication in bounded depth circuits
• Efficiency of a Good But Not Linear Set Union Algorithm
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• Unbounded fan-in circuits and associative functions

Cited in

(1)

• Algorithms and Computation

This page was built for publication: High girth augmented trees are huge

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