scientific article; zbMATH DE number 5066400

Publication date: 24 October 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Problem books (00A07) Recreational mathematics (00A08)

Related Items

A polynomial time algorithm for geodetic hull number for complementary prisms ⋮ Concentration inequalities for log-concave distributions with applications to random surface fluctuations ⋮ Deterministic bootstrap percolation on trees ⋮ On the number of connected sets in bounded degree graphs ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ The time of bootstrap percolation in two dimensions ⋮ Scaling and Inverse Scaling in Anisotropic Bootstrap Percolation ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Two results about the hypercube ⋮ On the Number of Connected Sets in Bounded Degree Graphs ⋮ Fast mixing via polymers for random graphs with unbounded degree ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ The time of bootstrap percolation with dense initial sets ⋮ Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality ⋮ Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three ⋮ Minimizing visible edges in polyhedra ⋮ Extremal problems for connected set enumeration ⋮ Ball polytopes and the Vázsonyi problem ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Open Problems on Search Games ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ A Trigonometrical Approach to Morley's Observation ⋮ Rigidity of proper colorings of \(\mathbb{Z}^d \) ⋮ Bootstrap percolation in random geometric graphs ⋮ A sharper threshold for bootstrap percolation in two dimensions ⋮ Anisotropic bootstrap percolation in three dimensions ⋮ EXTENSIONS OF AUTOCORRELATION INEQUALITIES WITH APPLICATIONS TO ADDITIVE COMBINATORICS ⋮ Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning ⋮ Lectures on the Spin and Loop O(n) Models ⋮ The Growth Constant of Odd Cutsets in High Dimensions ⋮ On the complexity of the \(P_{3}\)-hull number of the Cartesian product of graphs ⋮ Exponential decay of loop lengths in the loop \(\mathrm{O}(n)\) model with large \(n\) ⋮ Sentry Selection in Wireless Networks ⋮ Explicit geodesics in Gromov-Hausdorff space ⋮ Bootstrap percolation on the random graph \(G_{n,p}\) ⋮ The Prisoner Shouting Puzzle and Variations ⋮ Hamilton cycles in random geometric graphs ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ Sterrett procedure for the generalized group testing problem ⋮ Enumerating connected induced subgraphs: improved delay and experimental comparison ⋮ The combinatorics of N. G. de Bruijn ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ Absent-Minded Passengers ⋮ Barrier Coverage ⋮ The absent-minded passengers problem: a motivating challenge solved by computer algebra ⋮ On the Convexity of Paths of Length Two in Undirected Graphs ⋮ The second term for two-neighbour bootstrap percolation in two dimensions ⋮ Three convolution inequalities on the real line with connections to additive combinatorics ⋮ Optimal strong parity edge-coloring of complete graphs ⋮ On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs ⋮ The lost boarding pass and other practical problems ⋮ An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems