Graphs with unavoidable subgraphs with large degrees

DOI10.1002/JGT.3190120104MaRDI QIDQ3808128zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120104

zbMATH Keywords

cyclesminimum degreessimple graphssubgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4103118
• scientific article; zbMATH DE number 4103105
• Publication:4726282
• Subgraphs of minimal degree \(k\)
• scientific article; zbMATH DE number 969094

Cited in

(15)

• Subgraphs with large degrees and girth
• Long cycles in subgraphs with prescribed minimum degree
• Maximal cycles in graphs
• Extremal problems involving vertices and edges on odd cycles
• Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
• Subgraphs of graphs. I
• An extremal result for subgraphs with few edges
• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• scientific article; zbMATH DE number 4103105 (Why is no real title available?)
• scientific article; zbMATH DE number 4103118 (Why is no real title available?)
• scientific article; zbMATH DE number 125483 (Why is no real title available?)
• scientific article; zbMATH DE number 3999968 (Why is no real title available?)
• Graphs with many large degrees
• On unavoidable graphs
• Unavoidable vertex-minors in large prime graphs

This page was built for publication: Graphs with unavoidable subgraphs with large degrees

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