As of May 31, 2023, we have updated our Code of Conduct.
MathOverflow
Nathann Cohen's user avatar
Nathann Cohen's user avatar
Nathann Cohen's user avatar
Nathann Cohen
  • Member for 13 years, 6 months
  • Last seen more than 5 years ago
Profile Activity
Stats
1,614
reputation
66k
reached
34
answers
2
questions
Communities
Badges
View all badges
1
gold badge
10
silver badges
12
bronze badges
Top tags
View all tags
78
Score
22
Posts
61
Posts %
73
Score
24
Posts
67
Posts %
35
Score
11
Posts
31
Posts %
20
Score
2
Posts
6
Posts %
15
Score
2
Posts
6
Posts %
14
Score
3
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
20
Fast evaluation of polynomials
Jul 4, 2011
answer
13
Constructing Steiner Triple Systems Algorithmically
Aug 4, 2011
answer
10
A conjectured criterion for 4-colorable graphs
Sep 19, 2010
answer
7
Families of subsets of $\{1,\dots,n\}$ with regular intersections
Jul 29, 2010
answer
7
What is this operation on graphs called?
Sep 17, 2010
answer
7
Combinatorial designs textbook recommendation
Feb 24, 2015
answer
5
Lower bounds for chromatic number of a graph
Jul 30, 2010
answer
5
Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor
Aug 30, 2010
answer
5
Request for examples of 4-regular, non-planar, girth at least 5 graphs
Apr 10, 2015
answer
5
Number of linear orderings of a set to have balanced frequencies of triple orders
Oct 1, 2016
Top network posts
View all network posts
13
Are there good implementations for easy subclasses of NP-hard graph problems
12
Decompose a complete graph into smaller cliques
8
Number of non-isomorphic connected graphs of $n$ nodes and $m$ edges
8
Finding cliques in a big graph
8
Shortest paths disallowing each edge

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.