Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DM
1999

favoriteEmaildiscussreport

90views more DM 1999»

Induced subgraphs of given sizes

13 years 4 months ago

Induced subgraphs of given sizes

Download www.math.uiuc.edu

We say (n, e) (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Tur

Paul Erdös, Zoltán Füredi, Bruce

Real-time Traffic

DM 1999 | Extremal Graph Theory | M-vertex Spanned Subgraph | N-vertex Graph |

claim paper

Related Content

» Parameterized Complexity of Finding Regular Induced Subgraphs

» Fast Exponential Algorithms for Maximum rRegular Induced Subgraph Problems

» Learning a Hidden Subgraph

» Induced subgraphs of Ramsey graphs with many distinct degrees

» A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

» Finding Induced Subgraphs via Minimal Triangulations

» Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems

» Parameterized complexity of the induced subgraph problem in directed graphs

» Induced Subgraphs of Bounded Degree and Bounded Treewidth

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DM
Authors	Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós

Comments (0)