The following pages link to Karen Gunderson (Q298340):
Displayed 18 items.
- Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs (Q298341) (← links)
- Lower bounds for bootstrap percolation on Galton-Watson trees (Q457796) (← links)
- A sharp threshold for a modified bootstrap percolation with recovery (Q478467) (← links)
- Bounding the number of hyperedges in friendship \(r\)-hypergraphs (Q499453) (← links)
- Random Markov processes for countable and uncountable alphabets (Q503232) (← links)
- Almost separable matrices (Q512882) (← links)
- Minimum degree conditions for small percolating sets in bootstrap percolation (Q2185227) (← links)
- Burning the plane. Densities of the infinite Cartesian grid (Q2227973) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- Bootstrap percolation on Galton-Watson trees (Q2637757) (← links)
- Random geometric graphs and isometries of normed spaces (Q4580360) (← links)
- The time of graph bootstrap percolation (Q5360872) (← links)
- Induced forests in some distance-regular graphs (Q6153467) (← links)
- Random-step Markov processes (Q6255256) (← links)
- Limited packings of closed neighbourhoods in graphs (Q6257949) (← links)
- The oriented chromatic number of random graphs of bounded degree (Q6392087) (← links)
- Tur\'{a}n numbers and switching (Q6397221) (← links)
- Adversarial graph burning densities (Q6418777) (← links)