The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.

MaRDI QIDQ6644901

Matthew Cassar, Christina Zarb, Yair Caro, Josef Lauri

Publication date: 28 November 2024

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

zbMATH Keywords

\(G\)-free graphsinfinite family of graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The sum of the squares of the parts of a partition, and some related questions
• Induced subgraphs of given sizes
• The feasibility problem for line graphs
• The probabilistic method
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On the theory of graphs
• On the structure of linear graphs
• Absolutely avoidable order-size pairs for induced subgraphs
• Absolutely avoidable order-size pairs in hypergraphs
• Unavoidable order-size pairs in hypergraphs -- positive forcing density

This page was built for publication: The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644901)