Pages that link to "Item:Q898127"
From MaRDI portal
The following pages link to On the number of edges in a graph with no \((k + 1)\)-connected subgraphs (Q898127):
Displaying 11 items.
- A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges (Q968184) (← links)
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746) (← links)
- On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs (Q2197449) (← links)
- Finding densest \(k\)-connected subgraphs (Q2235249) (← links)
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs (Q2334065) (← links)
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645) (← links)
- On connected partition with degree constraints (Q2666577) (← links)
- (Q3841562) (← links)
- On the number of connected subgraphs with small edge‐boundary in regular graphs (Q4288885) (← links)
- Highly Connected Subgraphs with Large Chromatic Number (Q6141860) (← links)
- Counting connected partitions of graphs (Q6606326) (← links)
