Skip to search formSkip to main contentSkip to account menu

Forbidden subgraph problem

Known as: Turan-type problem 
In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G, find the maximal number of edges in an n-vertex… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Erdős–Hajnal conjectureForbidden graph characterizationGraph isomorphismHamiltonian path

Broader (1)

Extremal graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Strictly Interval Graphs: Characterization and Linear Time Recognition
2015
2015
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
2010
2010
On Independent Vertex Sets in Subclasses of Apple-Free Graphs
In a finite undirected graph, an apple consists of a chordless cycle of length at least 4, and an additional vertex which is not… 
2009
2009
On Minimally Nonouterplanarity of the Semi Total (Point) Graph of a Graph
We present here characterizations of graphs whose semi total (point) graphs are outerplanar and k -minimally nonouterplanar ( k… 
2009
2009
Two forbidden subgraphs and the existence of a 2-factor in graphs
In 1996, Ota and Tokuda showed that a star-free graph with sufficiently high minimum degree admits a 2-factor. More recently it… 
2007
2007
GALLAI AND ANTI-GALLAI GRAPHS OF A GRAPH
The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of… 
2007
2007
On invariants of hereditary graph properties
1999
1999
Forbidden triples and traceability: a characterization
1994
1994
Vc-Dimensions For Graphs
We study set systems over the vertex set (or edge set) of some graph that are induced by special graph properties like clique… 
1979
1979
Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks
An integral matrix with independent columns is called unimodular if the greatest common divisor of the determinants of its… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)