User Connor

4 votes

2 answers

262 views

Known result about existence of $n$-vertex $k$-uniform $r$-hypergraphs?

asked Oct 5, 2017 at 20:18

3 votes

1 answer

301 views

When Alexander dual of a simplicial complex is a matroid?

asked Aug 14, 2022 at 14:51

3 votes

1 answer

153 views

Number of points covered by $2n$ hyperplanes in $\mathbf{F}_p^n$

asked Sep 19 at 12:45

2 votes

0 answers

59 views

Maximum number of edges on $2^{k-1}+s$ vertices of a $k$-dimensional cube?

asked Feb 15, 2018 at 21:19

1 vote

1 answer

69 views

Existence of dense graph with relatively small codegree?

asked May 26, 2018 at 21:24

1 vote

1 answer

132 views

Find large "induced" bipartite graph in a dense graph?

asked Mar 12, 2019 at 19:35

1 vote

0 answers

164 views

How to prove this identity? (Perhaps related to partition) [closed]

asked May 3, 2014 at 14:06

1 vote

2 answers

360 views

Tight bound of Turan number for K_{1,t,t}

asked Mar 22, 2016 at 17:13

1 vote

1 answer

133 views

Connectivity of a matroid is at least its rank?

asked Aug 7, 2022 at 11:38

0 votes

1 answer

423 views

Reference for Turan Density

asked May 7, 2016 at 6:10

0 votes

1 answer

115 views

Any results concerning the numbers of vertices and edges to form fixed number of cliques in $K_n$?

asked Apr 18, 2019 at 14:51

0 votes

0 answers

36 views

Construct a maximum matching from a minimum vertex cover in bipartite graph?

asked Oct 23 at 18:05

0 votes

0 answers

166 views

Combine two types of permutations in a Young diagram?

asked Oct 28 at 19:03

0 votes

0 answers

36 views

separator and vertex-connectivity

asked Nov 28 at 13:54

Stack Exchange Network

14 Questions

Known result about existence of $n$-vertex $k$-uniform $r$-hypergraphs?

When Alexander dual of a simplicial complex is a matroid?

Number of points covered by $2n$ hyperplanes in $\mathbf{F}_p^n$

Maximum number of edges on $2^{k-1}+s$ vertices of a $k$-dimensional cube?

Existence of dense graph with relatively small codegree?

Find large "induced" bipartite graph in a dense graph?

How to prove this identity? (Perhaps related to partition) [closed]

Tight bound of Turan number for K_{1,t,t}

Connectivity of a matroid is at least its rank?

Reference for Turan Density

Any results concerning the numbers of vertices and edges to form fixed number of cliques in $K_n$?

Construct a maximum matching from a minimum vertex cover in bipartite graph?

Combine two types of permutations in a Young diagram?

separator and vertex-connectivity