# Forbidden subgraph problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Combinatorics, Probability & Computing
- 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)

Is this relevant?

2010

2010

- Eur. J. Comb.
- 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

- Journal of Graph Theory
- 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

- Journal of Graph Theory
- 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)

Is this relevant?

2005

2005

- Theory of Computing Systems
- 2005

Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends… (More)

Is this relevant?

2004

2004

- Discrete Mathematics
- 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

- Discrete Mathematics
- 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

- Discussiones Mathematicae Graph Theory
- 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

- 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

- STOC
- 1976

We present several techniques for proving lower bounds that can be applied to problems about grammars, formal languages, program… (More)

Is this relevant?