User Andrew D. King

20 votes

When your paper makes a borderline case for a top journal

answered Dec 24, 2010 at 20:40

10 votes

Non-mathematician submitting to top maths journal?

answered Nov 24, 2010 at 5:41

10 votes

Accepted

Does the cubic planar graph with 6 3-faces and 6 7-faces have a name?

answered Mar 8, 2013 at 16:50

9 votes

Most memorable titles

answered Dec 14, 2010 at 18:30

9 votes

What are examples of mathematical concepts named after the wrong people? (Stigler's law)

answered Oct 13, 2010 at 20:35

7 votes

Distribution of distances in permutations

answered Feb 19, 2013 at 17:35

7 votes

Accepted

Area ratio of a minimum bounding rectangle of a convex polygon

answered Apr 8, 2012 at 23:28

6 votes

How to find central vertex in a graph?

answered Feb 25, 2012 at 1:00

6 votes

What are your favorite instructional counterexamples?

answered Sep 2, 2010 at 21:10

6 votes

Accepted

Smallest non-isomorphic strongly regular graphs

answered Sep 19, 2010 at 18:23

5 votes

Accepted

Can you prove that hypergraphs with n-1 edges are partially 2 colorable?

answered Jul 27, 2011 at 13:55

4 votes

Coloring a graph by Maximum Independent Set extraction

answered Jan 7, 2013 at 20:08

4 votes

Does the notion of graphs with vertex multiplicity exist?

answered Oct 1, 2013 at 16:46

4 votes

Chromatic number of graphs of tangent closed balls

answered Mar 12, 2010 at 17:52

4 votes

Most intricate and most beautiful structures in mathematics

answered Dec 14, 2010 at 20:29

3 votes

Lower bounds for chromatic number of a graph

answered Sep 2, 2010 at 18:17

3 votes

Why is edge-coloring less interesting than vertex-coloring?

answered Mar 12, 2010 at 17:28

3 votes

Strengthening the induction hypothesis

answered Sep 30, 2010 at 23:48

3 votes

A k-1 edge connected k regular graph is matching covered

answered Oct 24, 2011 at 2:31

3 votes

Combinatorial Proof of Weak Perfect Graph Theorem.

answered Jun 13, 2011 at 12:32

3 votes

Accepted

Upper bound on Shannon capacity based on independence number

answered Nov 26, 2012 at 23:01

2 votes

Optimization over permutation?

answered Oct 2, 2010 at 20:25

2 votes

Suggest effective heuristic (not precise) graph colouring algorithm

answered Mar 12, 2010 at 18:00

2 votes

Accepted

Can 'network' and 'graph' be used interchangably?

answered Nov 2, 2010 at 17:00

2 votes

Reasonable "Random" matrices to test numerical algorithms

answered Feb 9, 2011 at 23:08

1 vote

Looking for a collection of entry level proofs

answered Oct 21, 2010 at 16:29

1 vote

Effect on connectivity when partitioning a graph

answered Mar 12, 2010 at 16:55

1 vote

Shannon capacity determined by $\alpha(G)$ and $\chi^*(\bar{G})$???

answered Dec 10, 2012 at 0:00

1 vote

Defining fuzzy properties of crisp graphs

answered Apr 16, 2012 at 5:25

1 vote

How to partition a graph into N groups with M elements nearest?

answered Aug 7, 2012 at 18:15

Stack Exchange Network

31 Answers

When your paper makes a borderline case for a top journal

Non-mathematician submitting to top maths journal?

Does the cubic planar graph with 6 3-faces and 6 7-faces have a name?

Most memorable titles

What are examples of mathematical concepts named after the wrong people? (Stigler's law)

Distribution of distances in permutations

Area ratio of a minimum bounding rectangle of a convex polygon

How to find central vertex in a graph?

What are your favorite instructional counterexamples?

Smallest non-isomorphic strongly regular graphs

Can you prove that hypergraphs with n-1 edges are partially 2 colorable?

Coloring a graph by Maximum Independent Set extraction

Does the notion of graphs with vertex multiplicity exist?

Chromatic number of graphs of tangent closed balls

Most intricate and most beautiful structures in mathematics

Lower bounds for chromatic number of a graph

Why is edge-coloring less interesting than vertex-coloring?

Strengthening the induction hypothesis

A k-1 edge connected k regular graph is matching covered

Combinatorial Proof of Weak Perfect Graph Theorem.

Upper bound on Shannon capacity based on independence number

Optimization over permutation?

Suggest effective heuristic (not precise) graph colouring algorithm

Can 'network' and 'graph' be used interchangably?

Reasonable "Random" matrices to test numerical algorithms

Looking for a collection of entry level proofs

Effect on connectivity when partitioning a graph

Shannon capacity determined by $\alpha(G)$ and $\chi^*(\bar{G})$???

Defining fuzzy properties of crisp graphs

How to partition a graph into N groups with M elements nearest?