Newbetuts

Show that if G is a simple graph with at least 4 vertices and 2n-3 edges, it must have two cycles of the same length.

Mapping The Unit Disc To The Hemisphere?

What is a directed acyclic graph (DAG)?

Prove that the sum of minimum edge cover and maximum matching is the vertex count

Generalized graph theory

Olympiad Graph Problem

Clever proof for showing that if a graph $G$ is critically $k-$colorable then $\delta(G) \geq k - 1$

Counting simple, connected, labeled graphs with N vertices and K edges

Prove or disprove bound on chromatic number.

k colorability and complete graph intuition

How to prevent edges in graphviz to overlap each other

What is the most efficient graph data structure in Python? [closed]

For a graph $G$, why should one expect the ratio $\text{ex} (n;G)/ \binom n2$ to converge?

k-regular simple graph without 1-factor

fitting points into partitions of a square

Spanning forests of bipartite graphs and distinct row/column sums of binary matrices

Partition a binary tree by removing a single edge

New posts in graph-theory

Applications of graph theory to algebra?

Kuratowski counterexample [duplicate]

Lower bound for the Ramsey number $R(3,t)$

Show that if G is a simple graph with at least 4 vertices and 2n-3 edges, it must have two cycles of the same length.

Mapping The Unit Disc To The Hemisphere?

What is a directed acyclic graph (DAG)?

Prove that the sum of minimum edge cover and maximum matching is the vertex count

Generalized graph theory

Olympiad Graph Problem

Clever proof for showing that if a graph $G$ is critically $k-$colorable then $\delta(G) \geq k - 1$

Counting simple, connected, labeled graphs with N vertices and K edges

Prove or disprove bound on chromatic number.

k colorability and complete graph intuition

How to prevent edges in graphviz to overlap each other

What is the most efficient graph data structure in Python? [closed]

For a graph $G$, why should one expect the ratio $\text{ex} (n;G)/ \binom n2$ to converge?

k-regular simple graph without 1-factor

fitting points into partitions of a square

Spanning forests of bipartite graphs and distinct row/column sums of binary matrices

Partition a binary tree by removing a single edge