On an extremal problem for locally sparse multigraphs

DOI10.1016/j.ejc.2023.103887arXiv2101.03056OpenAlexW3119886057MaRDI QIDQ6201879

Victor Falgas-Ravry

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph isomorphismsasymptotic extremal combinatoricsdensities of substructuresformal algebras

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Hypergraph containers
• Structure and enumeration theorems for hereditary properties in finite relational languages
• Extremal problems for multigraphs
• Turán problems for integer-weighted graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4351314 A weighted generalization of Tur�n's theorem]
• THE METHOD OF HYPERGRAPH CONTAINERS
• Extremal Theory of Locally Sparse Multigraphs
• An Extremal Graph Problem with a Transcendental Solution
• Multicolor containers, extremal entropy, and counting
• Independent sets in hypergraphs

This page was built for publication: On an extremal problem for locally sparse multigraphs