Absolutely avoidable order-size pairs for induced subgraphs

DOI10.4310/joc.2024.v15.n1.a2zbMath1526.05100arXiv2106.14908MaRDI QIDQ6087337

Maria A. Axenovich, Lea Weber

Publication date: 15 November 2023

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

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

zbMATH Keywords

sizeorderinduced subgraphsnumber of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Unavoidable order-size pairs in hypergraphs -- positive forcing density

This page was built for publication: Absolutely avoidable order-size pairs for induced subgraphs