Inducibility and universality for trees

DOI10.5070/C62359150zbMath1498.05054arXiv2102.02010MaRDI QIDQ5051466

Timothy F. N. Chan, Bojan Mohar, David R. Wood, Daniel Král'

Publication date: 23 November 2022

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.02010

zbMATH Keywords

treesgraph densityinducibility

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (1)

Subgraph densities in a surface

Cites Work

• Unnamed Item
• The clique density theorem
• On the page number of complete odd-partite graphs
• The inducibility of blow-up graphs
• A note on the inducibility of 4-vertex graphs
• Paths vs. stars in the local profile of trees
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• Cycles of length three and four in tournaments
• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• The inducibility of graphs
• Graph products and monochromatic multiplicities
• A bound on the inducibility of cycles
• Finitely forcible graph limits are universal
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• Multiplicities of subgraphs
• Cycles of a given length in tournaments
• Inducibility of \(d\)-ary trees
• On the exact maximum induced density of almost all graphs and their inducibility
• On the Number of 4-Cycles in a Tournament
• The number of cliques in graphs of given order and size
• Elusive extremal graphs
• On the Local Profiles of Trees
• On the Minimal Density of Triangles in Graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• The inducibility of complete bipartite graphs
• THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
• On the inducibility of small trees
• Inducibility of topological trees
• Inducibility in Binary Trees and Crossings in Random Tanglegrams
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• Undecidability of linear inequalities in graph homomorphism densities
• The Inducibility of Graphs on Four Vertices
• On the 3‐Local Profiles of Graphs
• On the densities of cliques and independent sets in graphs
• On the inducibility of cycles

This page was built for publication: Inducibility and universality for trees