All Questions
Tagged with combinatorial-designs graph-theory
3
questions with no upvoted or accepted answers
1
vote
0
answers
80
views
Bounds for smallest non-trivial designs
Given $s>t\ge 2$, let $N(s,t)$ be the smallest integer $n>s$ such that there exists an “$(n;s;t;1)$-design” (i.e., a collection of $s$-subsets $e_1,\dots,e_m$ of $[n]:=\{1,\dots,n\}$, such that ...
- 2,874
0
votes
0
answers
38
views
Minimal m such that m x K_n is decomposable into disjoint C_3
For a given $n$, is there a way to calculate the minimal value $m$ such that you can decompose the multigraph:
$$m \times K_n$$
into disjoint 3-cycles?
What about a more general result applied to ...
- 101
0
votes
0
answers
90
views
Steiner-like systems with large edges and many intersections
Let $l\geq 3$ be an integer. Is there $n\in\mathbb{N}$ and a hypergraph $H=(\{1,\ldots,n\},E)$ with the following properties?
for all $e\in E$ we have $|e| \geq l$
$e_1\neq e_2 \in E \implies |e_1 \...
- 44.5k