scientific article; zbMATH DE number 1151379
From MaRDI portal
Publication:4389332
zbMath0901.05001MaRDI QIDQ4389332
Jaroslav Nešetřil, Ji{ří} Matoušek
Publication date: 13 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsdiscrete mathematicsgenerating functionsgraph theoryplanar graphstreesprobabilistic methodproblem solvingfinite projective planesSperner's theoremcounting techniques
Related Items
On empty convex polygons in a planar point set ⋮ AFFINE FRACTAL LEAST SQUARES REGRESSION MODEL ⋮ Computational complexity of covering disconnected multigraphs ⋮ Collatz Meets Fibonacci ⋮ Partitions of graphs into cographs ⋮ Integrality gaps for colorful matchings ⋮ Some results about a conjecture on identifying codes in complete suns ⋮ Distance Constrained Labelings of Trees ⋮ Large Monochromatic Components in Two-colored Grids ⋮ Unnamed Item ⋮ Batalin-Vilkovisky structures on moduli spaces of flat connections ⋮ How many \(F\)'s are there in \(G\)? ⋮ A computable figure of merit for quasi-Monte Carlo point sets ⋮ Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View ⋮ A note on the subgraphs of the (\(2\times \infty \))-grid ⋮ Non-representability of finite projective planes by convex sets ⋮ Tree-depth, subgraph coloring and homomorphism bounds ⋮ Subquandles of affine quandles ⋮ Explicitly defined fractal interpolation functions with variable parameters ⋮ On randomized broadcasting in star graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Probabilistic strategies for the partition and plurality problems ⋮ Phase transition thresholds for some Friedman-style independence results ⋮ Cuts and bounds ⋮ Hanoi graphs and some classical numbers ⋮ Measuring linearity of connected configurations of a finite number of 2D and 3D curves
