Sizes of graphs with induced subgraphs of large maximum degree
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- Induced subgraphs with distinct sizes
- Disjoint subgraphs of large maximum degree
- Subgraphs with large degrees and girth
- The edge-statistics conjecture for \(\ell \ll k^{6/5} \)
- Large induced subgraphs with equated maximum degree
- Large induced subgraphs with \(k\) vertices of almost maximum degree
- Order of the largest Sachs subgraphs in graphs
- Edge-statistics on large graphs
- The size of the largest bipartite subgraphs
- Large induced subgraphs with three repeated degrees
- Induced subgraphs of prescribed size
- Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
- Smaller subgraphs of minimum degree \(k\)
This page was built for publication: Sizes of graphs with induced subgraphs of large maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815328)