Question

Lower bounds on # of hyper-edges in a hyper-graph with many near-perfect matchings

score 40 · Answer 1 · 2026-03-25 09:43:47

40

Views

Lower bounds on # of hyper-edges in a hyper-graph with many near-perfect matchings

Published on 25 Mar 2026 - 9:43

score 49 · Answer 2 · 2026-03-25 07:39:48

49

Views

Configuration of graph for maxcut algorithm

Published on 25 Mar 2026 - 7:39

score 69 · Answer 3 · 2019-04-14 00:10:28

69

Views

What are the three possible DAGs with two vertices

Published on 14 Apr 2019 - 0:10

score 3.7k · Answer 4 · 2026-03-28 07:08:15

3.7k

Views

How to colour the US map with Yellow, Green, Red and Blue to minimize the number of states with the color of Green

Published on 28 Mar 2026 - 7:08

score 41 · Answer 5 · 2019-04-14 09:00:02

41

Views

A variant of Ore condition in Hamilton graph

Published on 14 Apr 2019 - 9:00

score 163 · Answer 6 · 2026-04-01 00:10:23

How to use induction to show how to construct a graph with $2n$ nodes and $n^2$ edges such that the graph as exactly one, unique, complete pairing?

score 46 · Answer 7 · 2019-04-14 14:56:43

46

Views

Clique number and adding a vertex.

Published on 14 Apr 2019 - 14:56

score 76 · Answer 8 · 2026-03-26 03:02:30

76

Views

Definability of subgraphs of random graphs

Published on 26 Mar 2026 - 3:02

score 175 · Answer 9 · 2026-03-25 12:14:34

175

Views

$3n+1$ graph and shared vertices

Published on 25 Mar 2026 - 12:14

score 94 · Answer 10 · 2026-03-29 13:46:46

94

Views

Permutation graph and the number of inversion statistics

Published on 29 Mar 2026 - 13:46

score 1.7k · Answer 11 · 2019-04-14 21:26:32

1.7k

Views

What is an Arborescence (Graph Theory)?

Published on 14 Apr 2019 - 21:26

score 50 · Answer 12 · 2026-03-25 11:15:52

50

Views

In graph with bipartition $A, B$ show the following (see details):

Published on 25 Mar 2026 - 11:15

score 390 · Answer 13 · 2026-04-09 00:42:55

390

Views

Writing the Dijkstra Algorithm in Mathematics

Published on 09 Apr 2026 - 0:42

score 85 · Answer 14 · 2026-03-26 02:57:54

85

Views

Upper bound on the number of edges of a ten vertexes graph no $C_4, C_3$ subgraph.

Published on 26 Mar 2026 - 2:57

score 153 · Answer 15 · 2026-03-25 09:30:02

153

Views

If $G$ is a graph having $p$ vertices and min degree $\delta(G)\ge\frac{p-1}{2}$, then the edge connectivity is $\delta(G)$.

Published on 25 Mar 2026 - 9:30

List Question

Lower bounds on # of hyper-edges in a hyper-graph with many near-perfect matchings

Configuration of graph for maxcut algorithm

What are the three possible DAGs with two vertices

How to colour the US map with Yellow, Green, Red and Blue to minimize the number of states with the color of Green

A variant of Ore condition in Hamilton graph

How to use induction to show how to construct a graph with $2n$ nodes and $n^2$ edges such that the graph as exactly one, unique, complete pairing?

Clique number and adding a vertex.

Definability of subgraphs of random graphs

$3n+1$ graph and shared vertices

Permutation graph and the number of inversion statistics

What is an Arborescence (Graph Theory)?

In graph with bipartition $A, B$ show the following (see details):

Writing the Dijkstra Algorithm in Mathematics

Upper bound on the number of edges of a ten vertexes graph no $C_4, C_3$ subgraph.

If $G$ is a graph having $p$ vertices and min degree $\delta(G)\ge\frac{p-1}{2}$, then the edge connectivity is $\delta(G)$.

Trending Questions

Popular # Hahtags

Popular Questions