triangles in an optimal packing? More unsolved problems in mathematics Tuza's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning...
7 KB (809 words) - 00:14, 12 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
List of unsolved problems in mathematics (category Conjectures)
conjecture: every permutation on the n {\displaystyle n} -dimensional doubly-directed hypercube graph can be routed with edge-disjoint paths. Tuza's conjecture:...
195 KB (20,026 words) - 13:12, 7 May 2025
329, 1991, to add Tuza's name as coauthor. Houston-Edwards, Kelsey (April 5, 2021), "Mathematicians settle Erdős coloring conjecture", Quanta Magazine...
14 KB (1,617 words) - 20:45, 27 February 2025
Ryser's Conjecture" (PDF). "Ryser's conjecture | Open Problem Garden". www.openproblemgarden.org. Retrieved 2020-07-14. Tuza (1983). "Ryser's conjecture on...
7 KB (876 words) - 11:49, 28 April 2025
Graph pebbling (redirect from Graham's pebbling conjecture)
problems in mathematics Chung (1989) credited Ronald Graham with the conjecture that the pebbling number of a Cartesian product of graphs is at most equal...
9 KB (1,146 words) - 20:38, 16 January 2025
one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. Erdős pursued and proposed problems in discrete...
50 KB (5,402 words) - 21:12, 14 May 2025
Szegedy to characterize testable graph properties. Counting lemma Tuza's conjecture Graph edit distance Fox, Jacob (2011), "A new proof of the graph removal...
32 KB (5,077 words) - 23:54, 9 March 2025
S2CID 209835194 Dirac, G. A. (1957), "A theorem of R. L. Brooks and a conjecture of H. Hadwiger", Proceedings of the London Mathematical Society, 7 (1):...
7 KB (853 words) - 13:31, 28 March 2025
ISSN 0209-9683. S2CID 119725864. Dembowski 1968, p. 306 Tuza (1983). "Ryser's conjecture on transversals of r-partite hypergraphs". Ars Combinatorica...
9 KB (1,223 words) - 22:28, 10 February 2022
for connected graphs is often called the Edwards–Erdős bound as Erdős conjectured it. Edwards proved the Edwards-Erdős bound using the probabilistic method;...
25 KB (3,125 words) - 07:07, 19 April 2025
initiated a renewal of crisis, instability, and military domination and ended conjecture that the political system had matured or developed in a democratic mold...
101 KB (11,881 words) - 05:53, 16 April 2025
Robertson, Neil; Seymour, Paul D. (2004), "Graph Minors. XX. Wagner's conjecture", Journal of Combinatorial Theory, Series B, 92 (2): 325–357, doi:10.1016/j...
66 KB (7,684 words) - 15:08, 5 March 2025