Extremal problems for multigraphs

DOI10.1016/j.jctb.2021.12.003zbMath1487.05139arXiv2011.01626OpenAlexW4206713372MaRDI QIDQ2668012

A. Nicholas Day, Victor Falgas-Ravry, Andrew Treglown

Publication date: 3 March 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

multigraphsTurán-type problemstranscendental numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (2)

Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers] ⋮ On an extremal problem for locally sparse multigraphs

Cites Work

• Hypergraph containers
• Turán problems for integer-weighted graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4351314 A weighted generalization of Tur�n's theorem]
• Primary cyclotomic units and a proof of Catalans conjecture
• Extremal Theory of Locally Sparse Multigraphs
• An Extremal Graph Problem with a Transcendental Solution
• Multicolor containers, extremal entropy, and counting
• Independent sets in hypergraphs
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal problems for multigraphs