polytope theory, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989. It states...
7 KB (781 words) - 09:52, 5 September 2024
Commons has media related to Gil Kalai (mathematician). Kalai's home page at Hebrew University Combinatorics and more, Kalai's blog "Noise stability, noise...
8 KB (729 words) - 10:10, 16 May 2025
mathematical conjectures, over a wide field of subjects, and in many cases Erdős offered monetary rewards for solving them. The Erdős–Gyárfás conjecture on cycles...
14 KB (1,448 words) - 14:21, 6 May 2025
Sumner Byron Myers Prize for his PhD thesis. In 2009, during his PhD studies, Huh proved the Read–Hoggar conjecture, about the unimodality of coefficients...
14 KB (1,104 words) - 05:38, 17 March 2025
conjecture Kelvin's conjecture Kouchnirenko's conjecture Mertens conjecture Pólya conjecture, 1919 (1958) Ragsdale conjecture Schoenflies conjecture (disproved...
35 KB (1,461 words) - 12:50, 10 May 2025
Unsolved problem in mathematics Conjecture: If k complete graphs, each having exactly k vertices, have the property that every pair of complete graphs...
14 KB (1,617 words) - 20:45, 27 February 2025
Read's conjecture is a conjecture, first made by Ronald Read, about the unimodality of the coefficients of chromatic polynomials in the context of graph...
3 KB (259 words) - 22:54, 27 February 2025
A counterexample to the conjecture was discovered by Yaroslav Shitov (2019) (see Kalai 2019), thus disproving the conjecture in general. Any graph with...
15 KB (1,853 words) - 15:10, 16 January 2025
List of unsolved problems in mathematics (category Conjectures)
Improving lower and upper bounds for the Heilbronn triangle problem. Kalai's 3d conjecture on the least possible number of faces of centrally symmetric polytopes...
195 KB (20,026 words) - 13:12, 7 May 2025
Hirsch conjecture is the statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n − d. That...
10 KB (1,370 words) - 15:10, 16 January 2025
Erdős distinct distances problem (category Conjectures)
/ d ) {\displaystyle g_{d}(n)=O(n^{2/d})} and conjectured that the upper bound is in fact sharp, i.e., g d ( n ) = Θ ( n 2 / d ) {\displaystyle g_{d}(n)=\Theta...
8 KB (890 words) - 05:38, 14 October 2024
triangulations of space. Gil Kalai for making progress on the Hirsch conjecture by proving subexponential bounds on the diameter of d-dimensional polytopes with...
21 KB (1,965 words) - 23:53, 11 August 2024
the proofs of Kneser's conjecture and the Lovász local lemma, as well as the formulation of the Erdős–Faber–Lovász conjecture. He is also one of the eponymous...
16 KB (1,325 words) - 19:14, 27 April 2025
Paul Seymour (mathematician) (redirect from Paul D. Seymour)
structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers...
22 KB (2,285 words) - 19:10, 7 March 2025
Hirsch conjecture, now disproved, suggested a strong (linear) bound on how large the diameter of a polytope with fixed dimension d {\displaystyle d} and...
19 KB (2,304 words) - 19:59, 1 August 2024
33. The Hanner polytopes form an important class of examples for Kalai's 3d conjecture that all centrally symmetric polytopes have at least 3d nonempty...
11 KB (1,371 words) - 06:17, 13 November 2024
not on level d {\displaystyle d} . We similarly define f > d , f < d , f ≥ d , f ≤ d {\displaystyle f^{>d},f^{<d},f^{\geq d},f^{\leq d}} . The i {\displaystyle...
30 KB (5,379 words) - 14:18, 23 December 2024
Simplicial sphere (redirect from G-conjecture)
positivity". arXiv:1812.10454 [math.CO]. Kalai, Gil (2018-12-25). "Amazing: Karim Adiprasito proved the g-conjecture for spheres!". Combinatorics and more...
4 KB (515 words) - 02:09, 17 March 2025
Interdependent networks – Subfield of network science Invasion percolation Kahn–Kalai conjecture – Mathematical proposition Network theory – Study of graphs as a representation...
26 KB (3,133 words) - 05:14, 12 April 2025
edges, where c(k) is a constant depending only on k. This conjecture is known to be true for k = 3 and k = 4. It is also known to be true for convex geometric...
30 KB (3,579 words) - 11:39, 11 December 2024
m e ( m o d n ) {\displaystyle c:=m^{e}(\mathrm {mod} \;n)} , the RSA problem is to find m {\displaystyle m} . The problem is conjectured to be hard...
27 KB (3,303 words) - 17:58, 17 February 2025
for ovoidal Möbius planes. In 1993, together with Gil Kalai, he disproved Borsuk's conjecture. In 1996 he was awarded the Pólya Prize (SIAM). He was...
3 KB (262 words) - 21:17, 18 July 2024
Graph minor (section Major results and conjectures)
Hadwiger's conjecture", Journal of Combinatorial Theory, Series B, 99 (1): 20–29, doi:10.1016/j.jctb.2008.03.006, MR 2467815. Chudnovsky, Maria; Kalai, Gil;...
35 KB (4,046 words) - 02:37, 30 December 2024
Mathematics, 35 (3): 236–238, doi:10.1016/0001-8708(80)90050-X, MR 0563925. Kalai, Gil (2018-12-25). "Amazing: Karim Adiprasito proved the g-conjecture for spheres...
14 KB (2,250 words) - 22:10, 25 May 2024
determined by its 1-skeleton; his conjecture was proven in 1987 by Roswitha Blind and Peter Mani-Levitska. Gil Kalai shortly after provided a simpler proof...
4 KB (380 words) - 02:00, 20 July 2024
problem can be shown equivalent to Connes embedding problem, a famous conjecture in the theory of operator algebras. Since the dimensions of H A {\displaystyle...
65 KB (9,401 words) - 19:07, 3 May 2025
Blotto game). Borel conjectured the non-existence of mixed-strategy equilibria in finite two-person zero-sum games, a conjecture that was proved false...
138 KB (15,399 words) - 04:15, 2 May 2025
polytopes formed a class of important examples for the Mahler conjecture and for Kalai's 3d conjecture. In another paper from the same year, Hanner proved a set...
7 KB (645 words) - 13:59, 13 April 2025
overhead present in classical simulations, validating Feynman's 1982 conjecture. Over the years, experimentalists have constructed small-scale quantum...
113 KB (12,420 words) - 13:17, 14 May 2025
162, Issue 3, pp 431–461 doi:10.1007/s00440-014-0576-6 A proof of the block model threshold conjecture, Combinatorica, 2018, Volume 38, Issue 3, pp 665-708...
8 KB (802 words) - 21:16, 15 April 2025