Counting trees in graphs

zbMATH Open1344.05074MaRDI QIDQ311564FDOQ311564

Authors: J. Verstraëte, 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Tree-minimal graphs are almost regular
• On the Erdős-Sós conjecture and graphs with large minimum degree.
• A Local Approach to the Erdös--Sós Conjecture
• Tree embeddings
• On the number of trees having \(k\) edges in common with a graph of bounded degrees

zbMATH Keywords

pathsJensen's inequalityembedding treesrandom embedding

Mathematics Subject Classification ID

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

Cites Work

• Compactness results in extremal graph theory
• The Moore bound for irregular graphs
• Title not available (Why is that?)
• Tree-minimal graphs are almost regular
• Matrix power inequalities and the number of walks in graphs
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries

Cited In (12)

• Title not available (Why is that?)
• Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
• Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees
• Counting labels in binary trees
• A clique-free pseudorandom subgraph of the pseudo polarity graph
• Tree-minimal graphs are almost regular
• Unified approach to the generalized Turán problem and supersaturation
• Counting special families of labelled trees
• Off-diagonal book Ramsey numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting trees using symmetries

This page was built for publication: Counting trees in graphs

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