A note on universal graphs for spanning trees

DOI10.1016/J.DAM.2024.11.008MaRDI QIDQ6657271zbMATH OpenFDO

Authors Ervin Győri, Binlong Li, Nika Salia, Casey Tompkins

Publication date 6 January 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.11.008

zbMATH Keywords

extremal numberspanning treestreesuniversal graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 3935064
• Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
• Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result
• Minimal graphs with a prescribed number of spanning trees
• scientific article; zbMATH DE number 165095

Cites work

• Embedding spanning trees in random graphs
• scientific article; zbMATH DE number 3750997 (Why is no real title available?)
• On graphs which contain all small trees
• On Graphs Which Contain All Sparse Graphs
• On Universal Graphs for Spanning Trees
• Small universal graphs for bounded-degree planar graphs
• Spanning trees in random graphs
• Sparse universal graphs
• Sparse universal graphs for planarity
• Universal and unavoidable graphs
• Universal graphs and universal functions
• Universal Graphs for Bounded-Degree Trees and Planar Graphs

Cited in

(1)

• Universal geometric graphs

This page was built for publication: A note on universal graphs for spanning trees

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