Pages that link to "Item:Q6094711"
From MaRDI portal
The following pages link to Extremal problems for connected set enumeration (Q6094711):
Displaying 4 items.
- A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025) (← links)
- Estimation of the number of connected sets in a graph and the structure of components of random subsets (Q1594350) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)