Pages that link to "Item:Q2190887"
From MaRDI portal
The following pages link to Independence numbers of random subgraphs of some distance graph (Q2190887):
Displaying 7 items.
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Maximum sparse induced subgraphs of the binomial random graph with given number of edges (Q2214056) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) (Q2246874) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- The size of a maximum subgraph of the random graph with a given number of edges (Q2304366) (← links)
- On the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)