An Extremal Graph Problem with a Transcendental Solution

DOI10.1017/S0963548318000299zbMath1434.05078arXiv1607.07742WikidataQ129633320 ScholiaQ129633320MaRDI QIDQ5219321

Dhruv Mubayi, Caroline A. Terry

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

graph isomorphismsasymptotic extremal combinatoricsdensities of substructuresformal algebraspositive graph homomorphisms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22) Extremal combinatorics (05D99)

Related Items (4)

Extremal problems for multigraphs ⋮ Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers] ⋮ On an extremal problem for locally sparse multigraphs ⋮ Extremal Theory of Locally Sparse Multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• Hypergraph containers
• Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
• Structure and enumeration theorems for hereditary properties in finite relational languages
• Turán problems for integer-weighted graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4351314 A weighted generalization of Tur�n's theorem]
• Undecidability of linear inequalities in graph homomorphism densities
• On the structure of linear graphs
• Colloquium De Giorgi 2013 and 2014

This page was built for publication: An Extremal Graph Problem with a Transcendental Solution