Question

What is the minimal possible length of an $n$-universal word?

score 17 · Answer 1 · 2026-03-15 19:07:02

17

Views

What is the minimal possible length of an $n$-universal word?

Published on 15 Mar 2026 - 19:07

score 119 · Answer 2 · 2020-05-25 17:08:18

119

Views

Formula for How many combinations we can have from two sets with restrictions

Published on 25 May 2020 - 17:08

score 86 · Answer 3 · 2020-05-29 15:22:04

86

Views

Bounds on the number of maximal intersecting families

Published on 29 May 2020 - 15:22

score 727 · Answer 4 · 2020-06-03 10:49:27

727

Views

Family of subsets of $[n]$ and intersections

Published on 03 Jun 2020 - 10:49

score 33 · Answer 5 · 2026-03-25 17:42:05

33

Views

For $G \sim G(n, 0.5)$, $I$ a $k$-set of vertices, and event $E_I = \{G[I] \cong K_k \text{ or } K_k^c \}$, how many events does $E_I$ depend on?

Published on 25 Mar 2026 - 17:42

score 47 · Answer 6 · 2020-06-05 14:16:23

47

Views

Maximum $n$ such that $e2^{1 - {k \choose 2}}{k \choose 2}{{n-2} \choose {k-2}} \leq 1$, as $k \to \infty$.

Published on 05 Jun 2020 - 14:16

score 188 · Answer 7 · 2026-03-25 23:38:44

188

Views

Cardinality of the Minimum Feedback Vertex Set of a directed graph

Published on 25 Mar 2026 - 23:38

score 73 · Answer 8 · 2026-03-25 16:03:09

73

Views

How to show $p^3 \approx e^{-p{k \choose 2}}$ implies $p \approx \frac{12\ln(k)}{k^2}$?

Published on 25 Mar 2026 - 16:03

score 155 · Answer 9 · 2020-06-10 10:44:58

155

Views

Prove that at least one of the subsets is at most size $\sqrt{n}+1$

Published on 10 Jun 2020 - 10:44

score 369 · Answer 10 · 2020-06-12 17:41:03

369

Views

What is the best way to partition the $4$-subsets of $\{1,2,3,\dots,n\}$?

Published on 12 Jun 2020 - 17:41

score 59 · Answer 11 · 2026-03-25 17:40:30

59

Views

A step in the proof of Erdos-Tetali Lemma.

Published on 25 Mar 2026 - 17:40

score 71 · Answer 12 · 2020-06-14 00:03:34

71

Views

For graph G and integer k, exist coloring $V\to [k]$ s.t. $(1-1/k)$ of every vertex get different color.

Published on 14 Jun 2020 - 0:03

score 64 · Answer 13 · 2020-06-14 01:18:03

64

Views

There are $e^{O(n)}$ subsets of $\{1,2, \ldots, n\}$ s.t. symmetric difference of any two of them has size $\geq n / 3$.

Published on 14 Jun 2020 - 1:18

score 138 · Answer 14 · 2020-06-16 19:59:38

138

Views

Find the minimal maximal distance in a $n\times n$ square grid?

Published on 16 Jun 2020 - 19:59

score 148 · Answer 15 · 2020-06-19 13:58:32

148

Views

Required length of $\{0,1\}$-sequences to have unique hamming distances.

Published on 19 Jun 2020 - 13:58

List Question

What is the minimal possible length of an $n$-universal word?

Formula for How many combinations we can have from two sets with restrictions

Bounds on the number of maximal intersecting families

Family of subsets of $[n]$ and intersections

For $G \sim G(n, 0.5)$, $I$ a $k$-set of vertices, and event $E_I = \{G[I] \cong K_k \text{ or } K_k^c \}$, how many events does $E_I$ depend on?

Maximum $n$ such that $e2^{1 - {k \choose 2}}{k \choose 2}{{n-2} \choose {k-2}} \leq 1$, as $k \to \infty$.

Cardinality of the Minimum Feedback Vertex Set of a directed graph

How to show $p^3 \approx e^{-p{k \choose 2}}$ implies $p \approx \frac{12\ln(k)}{k^2}$?

Prove that at least one of the subsets is at most size $\sqrt{n}+1$

What is the best way to partition the $4$-subsets of $\{1,2,3,\dots,n\}$?

A step in the proof of Erdos-Tetali Lemma.

For graph G and integer k, exist coloring $V\to [k]$ s.t. $(1-1/k)$ of every vertex get different color.

There are $e^{O(n)}$ subsets of $\{1,2, \ldots, n\}$ s.t. symmetric difference of any two of them has size $\geq n / 3$.

Find the minimal maximal distance in a $n\times n$ square grid?

Required length of $\{0,1\}$-sequences to have unique hamming distances.

Trending Questions

Popular # Hahtags

Popular Questions