scientific article; zbMATH DE number 969094

MaRDI QIDQ5284560zbMATH OpenFDO

Authors Ralph Faudree, Tomasz Łuczak, Arun Jagota, P. Erdős

Publication date 17 February 1997

zbMATH Keywords

induced subgraphminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Subgraphs of minimal degree \(k\)
• Edge-disjoint induced subgraphs with given minimum degree
• Large Nearly Regular Induced Subgraphs
• Large planar subgraphs in dense graphs
• Full subgraphs

Cited in

(16)

• Subgraphs with large degrees and girth
• Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)
• A large subgraph of the minimum weight triangulation
• Disjoint subgraphs of large maximum degree
• Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
• Sizes of graphs with induced subgraphs of large maximum degree
• Locally sparse graph with large density
• Edge-disjoint induced subgraphs with given minimum degree
• Graphs with no induced \(K_{2,t}\)
• Construction of a family of graphs with a small induced proper subgraph with minimum degree 3
• Smaller subgraphs of minimum degree \(k\)
• Large planar subgraphs in dense graphs
• Graphs with unavoidable subgraphs with large degrees
• Decomposing large graphs with small graphs of high density
• scientific article; zbMATH DE number 1735672 (Why is no real title available?)
• Full subgraphs

This page was built for publication:

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