Large induced degenerate subgraphs | Zendy

Noga Alon | Zendy; J. Kahn | Zendy; Paul Seymour | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Large induced degenerate subgraphs

Author(s) -

Noga Alon,

J. Kahn,

Paul Seymour

Publication year - 1987

Publication title -

graphs and combinatorics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.59

H-Index - 40

eISSN - 1435-5914

pISSN - 0911-0119

DOI - 10.1007/bf01788542

Subject(s) - combinatorics , mathematics , degenerate energy levels , vertex (graph theory) , degree (music) , vertex connectivity , induced subgraph , degeneracy (biology) , sequence (biology) , graph , discrete mathematics , physics , biology , bioinformatics , genetics , quantum mechanics , acoustics

A graphH isd-degenerate if every subgraph of it contains a vertex of degree smaller thand. For a graphG, letad(G) denote the maximum number of vertices of an inducedd-degenerate subgraph ofG. Sharp lowers bounds forad(G) in terms of the degree sequence ofG are obtained, and the minimum number of edges of a graphG withn vertices anda2(G) = m is determined precisely for allm = n.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research