Subgraphs with large degrees and girth

DOI10.1007/BF02582956MaRDI QIDQ1066158zbMATH OpenOpenAlexFDO

Authors Carsten Thomassen

Publication date 1985

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02582956

zbMATH Keywords

large girthsubgraphlarge minimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 747033
• scientific article; zbMATH DE number 969094
• Subdivisions of graphs with large minimum degree
• Graphs with unavoidable subgraphs with large degrees
• Complete subgraphs with large degree sums
• Large Graphs with Given Degree and Diameter—Part I
• Topological subgraphs in graphs of large girth
• Sizes of graphs with induced subgraphs of large maximum degree
• On graphs with subgraphs having large independence numbers
• Subgraphs of large connectivity and chromatic number

Cites work

• Girth in graphs

Cited in

(9)

• Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
• scientific article; zbMATH DE number 3959468 (Why is no real title available?)
• scientific article; zbMATH DE number 4065027 (Why is no real title available?)
• Large induced subgraphs with three repeated degrees
• Large induced subgraphs with equated maximum degree
• Graphs with many large degrees
• Disjoint subgraphs of large maximum degree
• Large subgraphs without short cycles
• On a conjecture of Thomassen concerning subgraphs of large girth

This page was built for publication: Subgraphs with large degrees and girth

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