Nathann Cohen's user avatar
Nathann Cohen's user avatar
Nathann Cohen's user avatar
Nathann Cohen
  • Member for 14 years, 4 months
  • Last seen more than 6 years ago
14 votes

Constructing Steiner Triple Systems Algorithmically

10 votes

A conjectured criterion for 4-colorable graphs

7 votes

What is this operation on graphs called?

7 votes

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

7 votes

Combinatorial designs textbook recommendation

5 votes

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

5 votes

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

5 votes

Lower bounds for chromatic number of a graph

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

4 votes

How do researchers carry out computational experiments in Graph Theory?

4 votes

when does a regular graph have a 1-factorization?

4 votes

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

4 votes

Cycle of length 4 in an undirected graph

4 votes
Accepted

Cycle of length 4 in an undirected graph

4 votes

What packages for subgraph enumeration are available?

4 votes

Induced Subgraphs and Orbits of the automorphism group action

4 votes

Minimum size of the union of sets

4 votes
Accepted

Consistency of systems of inequalities involving only differences

3 votes

Building graphs as unions of disjoint edges

3 votes

Degree Sequences and Graph Enumeration

3 votes

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

2 votes

When does graph minor containment imply subgraph containment?

2 votes

Bipartite graph

2 votes

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

1 vote
Accepted

Uniformly random planar map

1 vote

Petersen 2-factor decomposition theorem for directed graphs

1 vote

Almost disjoint set (finite case)

1 vote

A strengthening of Frankl's union-closed conjecture?

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)

1 vote

regular graph, edge assignment