Skip to main content
MathOverflow
Thomas Edison's user avatar
Thomas Edison's user avatar
Thomas Edison's user avatar
Thomas Edison
  • Member for 9 years, 6 months
  • Last seen more than 2 years ago
Profile Activity
Stats
221
reputation
2k
reached
0
answers
8
questions
Communities
View all
Badges
This user doesn’t have any gold badges yet.
1
silver badge
7
bronze badges
Top tags
View all tags
0
Score
5
Posts
62
Posts %
0
Score
5
Posts
62
Posts %
0
Score
5
Posts
62
Posts %
0
Score
4
Posts
50
Posts %
0
Score
3
Posts
38
Posts %
0
Score
3
Posts
38
Posts %
Top posts
question
4
Geometry, Number Theory and Graph Theory of n-gon, permutation and graph labeling?
Jun 16, 2015
question
2
How to label a tree with minimum cost?
May 7, 2018
question
1
Cost associated set problem NP-hard
Oct 9, 2017
question
1
Is the partition of bipartite graphs NP-hard?
May 29, 2018
question
1
Bipartite clustering is NP-hard?
Jun 16, 2018
question
1
An variation of an assignment problem in combinatorics: assign items to customers
Jun 30, 2018
question
0
What (analytical or numerical) method can I use to solve scalar optimal problem?
Oct 26, 2016
question
0
Maximum partition of bipartite graph
May 23, 2018
Top network posts
View all network posts
7
If $f_n \to f$ uniformly and $g_n\to g$ uniformly, then $f_n\circ g_n \to f\circ g$ uniformly?
6
Pygame error: display surface quit: Why?
5
Let $f: [0, 1] \to \mathbb{R}$ s.t $f(0)=f(1)=0$ then measure of $A = \{h \in [0, 1] \mid \exists x \text{ such that }f(x+h) =f(x)\} \geq 1/2$.
5
Any undirected graph on 9 vertices with minimum degree at least 5 contains a subgraph $K_4$?
5
How to find composition of two piecewise-linear functions quickly?