Reputation
2,662
Next privilege 3,000 Rep.
Cast close & reopen votes
Badges
12 21
Newest
 Nice Answer
Impact
~122k people reached

Apr
22
answered Maximum size of a union of incomparable chains
Apr
20
revised Number of perfect matchings of bipartite graphs
edited body
Apr
12
revised What is the optimal size in the finite axiom of symmetry?
deleted 1 character in body
Apr
12
revised What is the optimal size in the finite axiom of symmetry?
added 1 character in body
Apr
12
revised What is the optimal size in the finite axiom of symmetry?
deleted 7 characters in body
Apr
12
revised What is the optimal size in the finite axiom of symmetry?
added 153 characters in body
Apr
12
answered What is the optimal size in the finite axiom of symmetry?
Apr
4
awarded  Nice Answer
Mar
29
awarded  Enlightened
Mar
29
awarded  Nice Answer
Mar
23
comment Construction of a graph
@მამუკაჯიბლაძე If vertices $v$ with neither $(v,v_1)\in E$ nor $(v,v_2)\in E$ were not allowed, then the graph would clearly have to have an even number of vertices.
Mar
23
comment Construction of a graph
Is the following restatement correct? There are two adjacent vertices $v_1,v_2$ with no common neighbor; and any two nonadjacent vertices have exactly two common neighbors.
Mar
20
accepted The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
added 51 characters in body
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
added 1 character in body
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
deleted 4 characters in body
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
added 9 characters in body
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
added 9 characters in body
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
added 9 characters in body
Mar
19
revised The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
added 220 characters in body