- Call for nominations for the Ostrowski Prize 2017
- Problems for Imre Bárány’s Birthday!
- Twelves short videos about members of the Department of Mathematics and Statistics at the University of Victoria
- Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
- Updates (belated) Between New Haven, Jerusalem, and Tel-Aviv
- Oded Goldreich Fest
- The Race to Quantum Technologies and Quantum Computers (Useful Links)
- Around the Garsia-Stanley’s Partitioning Conjecture
- My Answer to TYI- 28
Top Posts & Pages
- Academic Degrees and Sex
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Updates and plans III.
- When It Rains It Pours
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- Believing that the Earth is Round When it Matters
- AlexFest: 60 Faces of Groups
- Why Quantum Computers Cannot Work: The Movie!
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
Tag Archives: Cayley theorem
In the first part of this post we discussed an appealing conjecture regaring an extension of Cayley’s counting trees formula. The number of d-dimensional “hypertrees” should somehow add up to . But it was not clear to us which complexes we want … Continue reading
1. Helly’s theorem and Cayley’s formula Helly’s theorem asserts: For a family of n convex sets in , n > d, if every d+1 sets in the family have a point in common then all members in the family have a point in common. … Continue reading