Disjoint subgraphs of large maximum degree

DOI10.1016/S0012-365X(01)00190-XMaRDI QIDQ1598819zbMATH OpenOpenAlexFDO

Authors Oleg Pikhurko, Andrew Thomason

Publication date 28 May 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00190-x

zbMATH Keywords

induced subgraphextremal problemmaximum degreeprobabilistic method

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Recommendations

• Large disjoint subgraphs with the same order and size
• Maximum number of vertex-disjoint complete subgraphs
• Vertex-disjoint subgraphs with high degree sums
• Subdivisions of graphs with large minimum degree
• Subgraphs with large degrees and girth
• scientific article; zbMATH DE number 747033
• On disjoint maximal independent sets in graphs
• scientific article; zbMATH DE number 969094
• On graphs with subgraphs having large independence numbers
• Sizes of graphs with induced subgraphs of large maximum degree

Cited in

(2)

• Distinct degrees and homogeneous sets
• Self-similarity of graphs

This page was built for publication: Disjoint subgraphs of large maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598819)