User okw1124

6 votes

1 answer

565 views

Does every $4$-connected nonplanar graph contain a $K_5$-minor?

asked Nov 17, 2021 at 10:49

3 votes

2 answers

315 views

What kind of graph has more edges than its line graph?

asked Oct 30, 2021 at 23:14

3 votes

0 answers

99 views

If the girth of a $2k$-regular graph $G$ is larger than the diameter of a tree $T$ with $k$ edges, then $G$ is decomposed into copies of $T$

asked Sep 23, 2021 at 17:00

3 votes

1 answer

705 views

Connectivity and the minimum degree of bipartite graph

asked Oct 7, 2021 at 10:14

2 votes

2 answers

551 views

Two independent spanning trees of $2$-connected graph

asked Oct 8, 2021 at 0:33

2 votes

1 answer

391 views

Maximum number of leaf blocks in 3-regular (cubic) graph

asked Oct 10, 2021 at 4:22

2 votes

1 answer

236 views

The lower bound of number of vertices covered by maximum matching in $3$-regular graph

asked Oct 12, 2021 at 3:35

1 vote

1 answer

187 views

$K_{k,m}$ is $k$-choosable if and only if $m<k^k$

asked Oct 24, 2021 at 7:57

1 vote

1 answer

273 views

If $G$ and $H$ are $k$-critical, then applying Hajós construction to $G$ and $H$ makes $k$-critical graph

asked Oct 28, 2021 at 22:50

1 vote

1 answer

78 views

Pseudo-replication of a vertex in a perfect graph

asked Oct 31, 2021 at 17:27

1 vote

1 answer

404 views

An equitable edge-coloring of bipartite graphs

asked Nov 3, 2021 at 23:09

1 vote

0 answers

90 views

Proving $R(n_1+1,n_2+1,\cdots,n_k+1) \leq{n_1+n_2+\cdots+n_k \choose n_1,n_2,\cdots,n_k}$

asked Nov 25, 2021 at 17:59

0 votes

0 answers

37 views

Summing up the binary entropy function

asked Nov 8 at 3:24

Stack Exchange Network

13 Questions

Does every $4$-connected nonplanar graph contain a $K_5$-minor?

What kind of graph has more edges than its line graph?

If the girth of a $2k$-regular graph $G$ is larger than the diameter of a tree $T$ with $k$ edges, then $G$ is decomposed into copies of $T$

Connectivity and the minimum degree of bipartite graph

Two independent spanning trees of $2$-connected graph

Maximum number of leaf blocks in 3-regular (cubic) graph

The lower bound of number of vertices covered by maximum matching in $3$-regular graph

$K_{k,m}$ is $k$-choosable if and only if $m<k^k$

If $G$ and $H$ are $k$-critical, then applying Hajós construction to $G$ and $H$ makes $k$-critical graph

Pseudo-replication of a vertex in a perfect graph

An equitable edge-coloring of bipartite graphs

Proving $R(n_1+1,n_2+1,\cdots,n_k+1) \leq{n_1+n_2+\cdots+n_k \choose n_1,n_2,\cdots,n_k}$

Summing up the binary entropy function