Counting trees in graphs

zbMath1344.05074MaRDI QIDQ311564

Jacques Verstraete, Dhruv Mubayi

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p39

zbMATH Keywords

pathsJensen's inequalityembedding treesrandom embedding

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

A clique-free pseudorandom subgraph of the pseudo polarity graph ⋮ Off-diagonal book Ramsey numbers ⋮ Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs ⋮ Unified approach to the generalized Turán problem and supersaturation

Cites Work

• Tree-minimal graphs are almost regular
• Matrix power inequalities and the number of walks in graphs
• The Moore bound for irregular graphs
• Compactness results in extremal graph theory
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• Unnamed Item

This page was built for publication: Counting trees in graphs