Extremal Theory of Locally Sparse Multigraphs

DOI10.1137/19M1237612zbMath1450.05043arXiv1608.08948MaRDI QIDQ5128516

Dhruv Mubayi, Caroline A. Terry

Publication date: 27 October 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

multigraphenumerationextremal

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• On the number of graphs without 4-cycles
• Turán problems for integer-weighted graphs
• Extremal graphs without three‐cycles or four‐cycles
• [https://portal.mardi4nfdi.de/wiki/Publication:4351314 A weighted generalization of Tur�n's theorem]
• An Extremal Graph Problem with a Transcendental Solution
• Multicolor containers, extremal entropy, and counting
• Extensions of Turán's theorem on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal Theory of Locally Sparse Multigraphs