Subgraphs with large degrees and girth
The author has studied properties of graphs of large girth and minimum degree 3 in J. Comb. Theory, Ser. B 35, 129-141 (1983; Zbl 0537.05034). \textit{W. Mader} [Math. Ann. 194, 295-312 (1971; Zbl 0213.508)] showed that a graph of minimum degree 3 and large girth is contractible to a graph of large minimum degree. As a counterpart to this result the author suggests the following conjecture: For each pair of natural numbers r,g there exists f(r,g) such that any graph of minimum degree at least f(r,g) contains a subgraph of minimum degree r and girth at least g. The author also mentions a result of \textit{L. Pyber}, \textit{V. Rödl}, and \textit{E. Szemerédi} [Regular subgraphs in graphs with large average degree (to appear)].
- 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
- Disjoint subgraphs of large maximum degree
- Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
- Large induced subgraphs with three repeated degrees
- Large subgraphs without short cycles
- scientific article; zbMATH DE number 3959468 (Why is no real title available?)
- scientific article; zbMATH DE number 4065027 (Why is no real title available?)
- On a conjecture of Thomassen concerning subgraphs of large girth
- Graphs with many large degrees
- Large induced subgraphs with equated maximum degree
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)
