Reputation
3,233
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
1 10 48
Newest
 Excavator
Impact
~194k people reached

1d
revised What is a Hungarian forest: definition
edited title
1d
asked What is a Hungarian forest: definition
Feb
1
revised Abstract dual of a graph and $K_{3,3}$
added 68 characters in body
Feb
1
revised Abstract dual of a graph and $K_{3,3}$
deleted 38 characters in body; edited title
Feb
1
comment How to show the complete graph $K_5$ has no abstract dual
You have used two different definitions of the dual graph: one to show that $G$ has order $7$ and the other to show that $\delta(G)\ge 3$. How can one reconcile the two definitions?
Feb
1
revised Abstract dual of a graph and $K_{3,3}$
deleted 530 characters in body
Jan
31
asked Abstract dual of a graph and $K_{3,3}$
Jan
31
awarded  Excavator
Jan
31
revised Planar complete tripartite graphs
fixed grammar
Jan
31
asked Why graph factorization problems emphasize $k$-regular graphs
Jan
29
revised Konig's theorem and perfect graphs
added 10 characters in body
Jan
29
comment Konig's theorem and perfect graphs
@SeanEnglish: A perfect graph is one in which for every induced subgraph the clique and chromatic numbers are equal.
Jan
29
asked Konig's theorem and perfect graphs
Jan
25
asked Kuratowski's theorem proof: Flappable bridges
Jan
22
comment The size of the automorphism group of a graph
Since $Aut(K_n)=S_n$ so certainly all graphs do not have automorphism groups of size 1 or 2.
Jan
22
comment An inequality involving factorials and two variables
@flawr: Thanks. I proved it on the lines suggested.
Jan
22
accepted An inequality involving factorials and two variables
Jan
21
comment An inequality involving factorials and two variables
@flawr: What do you mean by doing one? Are you saying that we assume the result for $n-1$ and all $m$?
Jan
21
asked An inequality involving factorials and two variables
Jan
16
accepted A doubt in the proof of Kuratowski theorem