The following pages link to Gil Kalai (Q177917):
Displaying 50 items.
- Rigidity and the lower bound theorem. I (Q578590) (← links)
- A new basis of polytopes (Q582295) (← links)
- Regular subgraphs of almost regular graphs (Q595688) (← links)
- A topological colorful Helly theorem (Q702702) (← links)
- On the correlation of increasing families (Q739391) (← links)
- Intersection patterns of convex sets (Q762464) (← links)
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes (Q791200) (← links)
- Every 4-regular graph plus an edge contains a 3-regular subgraph (Q798336) (← links)
- The number of faces of centrally-symmetric polytopes (Q839926) (← links)
- Intersections of Leray complexes and regularity of monomial ideals (Q855856) (← links)
- A law of large numbers for weighted majority (Q864871) (← links)
- Bipartite minors (Q896000) (← links)
- A multiperversity generalization of intersection homology (Q930781) (← links)
- (Q958228) (redirect page) (← links)
- Neighborly embedded manifolds (Q958230) (← links)
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions (Q1062277) (← links)
- A new approach to Turán's conjecture (Q1066899) (← links)
- f-vectors of acyclic complexes (Q1067262) (← links)
- A simple proof of the upper bound theorem (Q1068364) (← links)
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions (Q1080184) (← links)
- Hyperconnectivity of graphs (Q1086586) (← links)
- Many triangulated spheres (Q1094674) (← links)
- An extended Euler-Poincaré theorem (Q1117466) (← links)
- A simple way to tell a simple polytope from its graph (Q1120602) (← links)
- A note on an evaluation of Abel sums (Q1145805) (← links)
- Upper bounds for the diameter and height of graphs of convex polyhedra (Q1196197) (← links)
- Asymptotic stability and other properties of trajectories and transfer sequences leading to the bargaining sets (Q1253192) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- Influences of variables and threshold intervals under group symmetries (Q1365201) (← links)
- Guarding galleries where every point sees a large area (Q1380500) (← links)
- Learnability and rationality of choice. (Q1420879) (← links)
- First passage percolation has sublinear distance variance. (Q1433887) (← links)
- Three theorems, with computer-aided proofs, on three-dimensional faces and quotients of polytopes (Q1580762) (← links)
- Boolean functions: influence, threshold and noise (Q1620841) (← links)
- Around two theorems and a lemma by Lucio Russo (Q1648777) (← links)
- Chvátal's conjecture and correlation inequalities (Q1703446) (← links)
- Bidding games and efficient allocations (Q1756335) (← links)
- The influence of variables in product spaces (Q1802329) (← links)
- Transversal numbers for hypergraphs arising in geometry (Q1865252) (← links)
- A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem. (Q1866178) (← links)
- Boolean functions whose Fourier transform is concentrated on the first two levels. (Q1866179) (← links)
- Bounding the piercing number (Q1892406) (← links)
- Statistical aspects of the quantum supremacy demonstration (Q2163070) (← links)
- Intersection patterns of planar sets (Q2197685) (← links)
- Turán, involution and shifting (Q2421565) (← links)
- Quasi-random multilinear polynomials (Q2631886) (← links)
- On low-dimensional faces that high-dimensional polytopes must have (Q2640884) (← links)
- (Q2739351) (← links)
