Newbetuts

Strengthening of a lemma in Ramsey Theory: $R(m, n) \le R(m-1, n) + R(m, n-1)-1$ if both numbers are even

Can a bipartite graph have many Hamiltonian paths but no Hamiltonian cycle?

Smallest nonhamiltonian 2-connected bicubic graph with chromatic index 3

The existence of a common set of representatives deduced from graph theory

Existence of a self-complementary graph

Graph Theory Pigeonhole Principle Question [duplicate]

Which graphs can be drawn using straight lines with no disjoint edges?

Every tree has two leaves. Is my proof ok?

Dynamically two-coloring a finite graph

How do I run graphx with Python / pyspark?

is it allowed to have nesting Induction?

Geometric intuition of graph Laplacian matrices

Divide a square into rectangles where each occurs once in each orientation

Connected graph with colored edges

Prove that the group of automorphisms of a labelled Cayley graph of a group G is the group G itself (Just stumped on one direction)

Which sets are "connectable"?

New posts in graph-theory

How to get the adjacency matrix of the dual of $G$ without pen and paper?

Maximum number of edges in a simple graph?

How to find the girth of a graph?

Proving that irreducibility of a matrix implies strong connectedness of the graph [duplicate]

Strengthening of a lemma in Ramsey Theory: $R(m, n) \le R(m-1, n) + R(m, n-1)-1$ if both numbers are even

Can a bipartite graph have many Hamiltonian paths but no Hamiltonian cycle?

Smallest nonhamiltonian 2-connected bicubic graph with chromatic index 3

The existence of a common set of representatives deduced from graph theory

Existence of a self-complementary graph

Graph Theory Pigeonhole Principle Question [duplicate]

Which graphs can be drawn using straight lines with no disjoint edges?

Every tree has two leaves. Is my proof ok?

Dynamically two-coloring a finite graph

How do I run graphx with Python / pyspark?

is it allowed to have nesting Induction?

Geometric intuition of graph Laplacian matrices

Divide a square into rectangles where each occurs once in each orientation

Connected graph with colored edges

Prove that the group of automorphisms of a labelled Cayley graph of a group G is the group G itself (Just stumped on one direction)

Which sets are "connectable"?