Tree-minimal graphs are almost regular

DOI10.4310/JOC.2012.V3.N1.A2MaRDI QIDQ353399zbMATH OpenOpenAlexFDO

Authors Domingos Dellamonica, Penny Haxell, Tomasz Łuczak, Dhruv Mubayi, B. Nagle, Yury Person, Vojtěch Rödl, M. Schacht

Publication date 12 July 2013

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2012.v3.n1.a2

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35)

Recommendations

• Counting trees in graphs
• Tree embeddings
• Ramsey numbers involving graphs with large degrees
• scientific article; zbMATH DE number 3593607
• Disjoint \(K_{r}\)-minors in large graphs with given average degree
• The average connectivity of a graph
• Note on a problem of M. Talagrand
• The average size of independent sets of graphs
• Average distance and maximum induced forest

Cited in

(6)

• scientific article; zbMATH DE number 165095 (Why is no real title available?)
• On the local approach to Sidorenko's conjecture
• Minimum monopoly in regular and tree graphs
• Counting trees in graphs
• Unified approach to the generalized Turán problem and supersaturation
• Graph homomorphisms between trees

This page was built for publication: Tree-minimal graphs are almost regular

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