Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Matthew Kahle
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
11
votes
Is it true that a connected graph has a spanning tree, if the graph has uncountably many vertices?
combinatorics
graph-theory
set-theory
asked Oct 25 '11 at 22:15
math.stackexchange.com
8
votes
Representing a number as a sum of at most $k$ squares
elementary-number-theory
analytic-number-theory
modular-forms
quadratic-forms
asked Oct 13 '11 at 19:28
math.stackexchange.com
7
votes
chromatic number of a graph versus its complement
combinatorics
graph-theory
extremal-combinatorics
asked Nov 2 '11 at 19:36
math.stackexchange.com
6
votes
How did they simplify this expression involving roots of unity?
combinatorics
complex-numbers
asked Oct 12 '11 at 21:22
math.stackexchange.com
6
votes
An inequality for graphs
graph-theory
inequality
asked Nov 1 '11 at 2:43
math.stackexchange.com
6
votes
Two CW complexes with isomorphic homotopy groups and homology, yet not homotopy equivalent
algebraic-topology
examples-counterexamples
homotopy-theory
asked Dec 6 '11 at 17:44
math.stackexchange.com
6
votes
Does the Hirsch conjecture hold for $n < 2d$?
combinatorics
linear-programming
asked Jan 20 '12 at 18:09
math.stackexchange.com
6
votes
can the following sum be simplified
combinatorics
summation
asked Jun 4 at 18:28
math.stackexchange.com
Top Answers
9
What is the inverse function of $\ x^2+x$?
math.stackexchange.com
7
Counting in Two ways: $m^3 = 6 {m \choose 3} + 6 {m \choose 2} + m \quad \forall m \in \mathbb{N}$
math.stackexchange.com
6
Is it true that a connected graph has a spanning tree, if the graph has uncountably many vertices?
math.stackexchange.com
Stack Exchange works best with JavaScript enabled