The following pages link to Paul N. Balister (Q817615):
Displaying 50 items.
- (Q298339) (redirect page) (← links)
- Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs (Q298341) (← links)
- Subtended angles (Q312334) (← links)
- The time of bootstrap percolation in two dimensions (Q328784) (← links)
- Projections, entropy and sumsets (Q452821) (← links)
- Adversarial resilience of matchings in bipartite random graphs (Q501985) (← links)
- Random partial orders defined by angular domains (Q634753) (← links)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (Q817616) (← links)
- Pair dominating graphs (Q819016) (← links)
- Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions (Q885451) (← links)
- (Q941390) (redirect page) (← links)
- Connected graphs without long paths (Q941391) (← links)
- Highly connected random geometric graphs (Q1003675) (← links)
- Convex sets in acyclic digraphs (Q1016095) (← links)
- (Q1044040) (redirect page) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- Note on Nakayama's lemma for compact \(\Lambda\)-modules (Q1383454) (← links)
- Packing closed trails into dense graphs. (Q1405105) (← links)
- Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
- Balanced edge colorings. (Q1425105) (← links)
- Dependent percolation in two dimensions (Q1584538) (← links)
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) (Q1613483) (← links)
- The sharp threshold for making squares (Q1643387) (← links)
- Decompositions of graphs into cycles with chords (Q1682208) (← links)
- A note on Linnik's theorem on quadratic non-residues (Q1737357) (← links)
- Dense subgraphs in random graphs (Q1741497) (← links)
- A concentration function estimate and intersective sets from matrices (Q1760366) (← links)
- Continuum percolation with steps in an annulus (Q1769415) (← links)
- Entropy along convex shapes, random tilings and shifts of finite type (Q1856419) (← links)
- Zero-sum square matrices (Q1864564) (← links)
- The interlace polynomial of graphs at \(-1\) (Q1864589) (← links)
- The Erdős-Selfridge problem with square-free moduli (Q2027508) (← links)
- On the Erdős covering problem: the density of the uncovered set (Q2118065) (← links)
- Covering intervals with arithmetic progressions (Q2204100) (← links)
- Flat Littlewood polynomials exist (Q2215807) (← links)
- Erdős covering systems (Q2220975) (← links)
- The asymptotic number of prefix normal words (Q2317872) (← links)
- Counting regions with bounded surface area (Q2384759) (← links)
- Catching a fast robber on the grid (Q2401986) (← links)
- Coloring vertices and edges of a graph by nonempty subsets of a set (Q2430971) (← links)
- Connectivity of addable graph classes (Q2483480) (← links)
- On the Alspach Conjecture (Q2726708) (← links)
- Packing Circuits into <i>K</i><sub><i>N</i></sub> (Q2777895) (← links)
- A note on Ramsey size-linear graphs (Q2778280) (← links)
- Subcritical $\mathcal {U}$-bootstrap percolation models have non-trivial phase transitions (Q2796096) (← links)
- Random Hypergraph Irregularity (Q2797089) (← links)
- Barrier Coverage (Q2830235) (← links)
- (Q2874912) (← links)
- Critical Probabilities of 1-Independent Percolation Models (Q2883850) (← links)
- Minimal Symmetric Differences of Lines in Projective Planes (Q2931715) (← links)