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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any element of H as an induced subgraph… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
In this note, extending some results of Erd1⁄2os, Frankl, Rödl, Alexeev, Bollobás and Thomason, we determine asymptotically the… (More)
Is this relevant?
2009
2009
This note is part of an ongoing project aiming to renovate some classical results in extremal graph theory, see, e.g., [2] and [5… (More)
Is this relevant?
2008
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
In this paper we investigate chromatic aspects for graphs with forbidden induced subgraphs with emphasis on the question of 3… (More)
Is this relevant?
2002
2002
In this paper we study the chromatic number for graphs with forbidden induced subgraphs. We focus our interest on graph classes… (More)
Is this relevant?
2001
2001
A property of graphs is any class of graphs closed under isomorphism. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is… (More)
Is this relevant?
1999
1999
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected… (More)
Is this relevant?
1976
1976
We present several techniques for proving lower bounds that can be applied to problems about grammars, formal languages, program… (More)
  • figure 1
  • figure 4
Is this relevant?