The following pages link to (Q5393667):
Displayed 50 items.
- The time of bootstrap percolation in two dimensions (Q328784) (← links)
- The time of bootstrap percolation with dense initial sets (Q400563) (← links)
- A sharper threshold for bootstrap percolation in two dimensions (Q438962) (← links)
- On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs (Q510982) (← links)
- Exponential decay of loop lengths in the loop \(\mathrm{O}(n)\) model with large \(n\) (Q512314) (← links)
- Hamilton cycles in random geometric graphs (Q549867) (← links)
- Ball polytopes and the Vázsonyi problem (Q624221) (← links)
- Bootstrap percolation on the random graph \(G_{n,p}\) (Q691111) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
- Optimal strong parity edge-coloring of complete graphs (Q1046737) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
- Two results about the hypercube (Q1671353) (← links)
- Explicit geodesics in Gromov-Hausdorff space (Q1994826) (← links)
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- The absent-minded passengers problem: a motivating challenge solved by computer algebra (Q2071521) (← links)
- On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs (Q2096273) (← links)
- Concentration inequalities for log-concave distributions with applications to random surface fluctuations (Q2129697) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- Anisotropic bootstrap percolation in three dimensions (Q2212604) (← links)
- Sterrett procedure for the generalized group testing problem (Q2283674) (← links)
- Three convolution inequalities on the real line with connections to additive combinatorics (Q2329261) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- Fast mixing via polymers for random graphs with unbounded degree (Q2672271) (← links)
- Rigidity of proper colorings of \(\mathbb{Z}^d \) (Q2689658) (← links)
- Barrier Coverage (Q2830235) (← links)
- On the Convexity of Paths of Length Two in Undirected Graphs (Q2839205) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Open Problems on Search Games (Q2961395) (← links)
- Lectures on the Spin and Loop O(n) Models (Q3297366) (← links)
- Sentry Selection in Wireless Networks (Q3566390) (← links)
- Scaling and Inverse Scaling in Anisotropic Bootstrap Percolation (Q4558933) (← links)
- The Growth Constant of Odd Cutsets in High Dimensions (Q4643314) (← links)
- Absent-Minded Passengers (Q4972075) (← links)
- A polynomial time algorithm for geodetic hull number for complementary prisms (Q5037202) (← links)
- Deterministic bootstrap percolation on trees (Q5045263) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- A Trigonometrical Approach to Morley's Observation (Q5113528) (← links)
- EXTENSIONS OF AUTOCORRELATION INEQUALITIES WITH APPLICATIONS TO ADDITIVE COMBINATORICS (Q5138959) (← links)
- The second term for two-neighbour bootstrap percolation in two dimensions (Q5241505) (← links)
- The Prisoner Shouting Puzzle and Variations (Q5742353) (← links)
- The lost boarding pass and other practical problems (Q5860207) (← links)
- Enumerating connected induced subgraphs: improved delay and experimental comparison (Q5918096) (← links)
- Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality (Q6072209) (← links)
- Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three (Q6077983) (← links)
- Minimizing visible edges in polyhedra (Q6083182) (← links)