User Nathann Cohen

14 votes

Constructing Steiner Triple Systems Algorithmically

answered Aug 4, 2011 at 14:52

10 votes

A conjectured criterion for 4-colorable graphs

answered Sep 19, 2010 at 23:18

7 votes

What is this operation on graphs called?

answered Sep 17, 2010 at 11:05

7 votes

Families of subsets of $\{1,\dots,n\}$ with regular intersections

answered Jul 29, 2010 at 9:05

7 votes

Combinatorial designs textbook recommendation

answered Feb 24, 2015 at 8:15

5 votes

Request for examples of 4-regular, non-planar, girth at least 5 graphs

answered Apr 10, 2015 at 10:13

5 votes

Number of linear orderings of a set to have balanced frequencies of triple orders

answered Oct 1, 2016 at 11:03

5 votes

Lower bounds for chromatic number of a graph

answered Jul 30, 2010 at 2:22

5 votes

Accepted

Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor

answered Aug 30, 2010 at 6:32

4 votes

How do researchers carry out computational experiments in Graph Theory?

answered Sep 24, 2010 at 19:36

4 votes

when does a regular graph have a 1-factorization?

answered Apr 28, 2011 at 13:43

4 votes

Find Graph Cut such that Graph becomes a DAG and Edge Weights are Minimized

answered Apr 30, 2011 at 16:04

4 votes

Cycle of length 4 in an undirected graph

answered Jun 16, 2011 at 16:18

4 votes

Accepted

Cycle of length 4 in an undirected graph

answered Jun 16, 2011 at 16:23

4 votes

What packages for subgraph enumeration are available?

answered Jan 17, 2011 at 16:04

4 votes

Induced Subgraphs and Orbits of the automorphism group action

answered Jul 16, 2011 at 12:14

4 votes

Minimum size of the union of sets

answered Aug 22, 2015 at 14:52

4 votes

Accepted

Consistency of systems of inequalities involving only differences

answered Mar 29, 2012 at 10:08

3 votes

Building graphs as unions of disjoint edges

answered Nov 12, 2013 at 16:07

3 votes

Degree Sequences and Graph Enumeration

answered Jul 17, 2011 at 15:44

3 votes

Example of: K-regular graph with girth K, for a given K

answered Nov 28, 2010 at 9:14

2 votes

When does graph minor containment imply subgraph containment?

answered Aug 1, 2010 at 1:28

2 votes

Bipartite graph

answered Jun 18, 2014 at 10:31

2 votes

In what types of graphs can the maximum independent set be found in polynomial time?

answered Dec 27, 2015 at 18:56

1 vote

Accepted

Uniformly random planar map

answered Sep 18, 2012 at 17:54

1 vote

Petersen 2-factor decomposition theorem for directed graphs

answered Nov 16, 2014 at 13:35

1 vote

Almost disjoint set (finite case)

answered Mar 17, 2014 at 13:23

1 vote

A strengthening of Frankl's union-closed conjecture?

answered Apr 7, 2014 at 11:09

1 vote

Accepted

What is the minimum set of combinations C(p,n) required to guarantee q<p matches with a target combination (pT,n)

answered Aug 9, 2010 at 15:33

1 vote

regular graph, edge assignment

answered Jul 13, 2011 at 20:54

Stack Exchange Network

34 Answers

Constructing Steiner Triple Systems Algorithmically

A conjectured criterion for 4-colorable graphs

What is this operation on graphs called?

Families of subsets of $\{1,\dots,n\}$ with regular intersections

Combinatorial designs textbook recommendation

Request for examples of 4-regular, non-planar, girth at least 5 graphs

Number of linear orderings of a set to have balanced frequencies of triple orders

Lower bounds for chromatic number of a graph

Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor

How do researchers carry out computational experiments in Graph Theory?

when does a regular graph have a 1-factorization?

Find Graph Cut such that Graph becomes a DAG and Edge Weights are Minimized

Cycle of length 4 in an undirected graph

Cycle of length 4 in an undirected graph

What packages for subgraph enumeration are available?

Induced Subgraphs and Orbits of the automorphism group action

Minimum size of the union of sets

Consistency of systems of inequalities involving only differences

Building graphs as unions of disjoint edges

Degree Sequences and Graph Enumeration

Example of: K-regular graph with girth K, for a given K

When does graph minor containment imply subgraph containment?

Bipartite graph

In what types of graphs can the maximum independent set be found in polynomial time?

Uniformly random planar map

Petersen 2-factor decomposition theorem for directed graphs

Almost disjoint set (finite case)

A strengthening of Frankl's union-closed conjecture?

What is the minimum set of combinations C(p,n) required to guarantee q<p matches with a target combination (pT,n)

regular graph, edge assignment