Question

Prove that the maximum number of edges in a graph with no even cycles is floor(3(n-1)/2)

score 6.8k · Answer 1 · 2013-07-08 13:26:10

6.8k

Views

Prove that the maximum number of edges in a graph with no even cycles is floor(3(n-1)/2)

Published on 08 Jul 2013 - 13:26

score 450 · Answer 2 · 2013-07-15 09:04:28

450

Views

Counting the number of subgraphs isomorphic with the following digraph

Published on 15 Jul 2013 - 9:04

score 390 · Answer 3 · 2026-03-26 08:02:27

390

Views

Show there’s at most $n\choose \left \lfloor\frac{n}{2} \right\rfloor$ subsets $A\subset[n]$ such that $\displaystyle\sum\limits_{i\in{A}} a_i=\alpha$

Published on 26 Mar 2026 - 8:02

score 56 · Answer 4 · 2026-02-23 17:23:08

56

Views

An extremal combinatorial problem over Finite rings

Published on 23 Feb 2026 - 17:23

score 197 · Answer 5 · 2013-08-10 20:06:22

197

Views

Has this variation of blocking set been studied before?

Published on 10 Aug 2013 - 20:06

score 331 · Answer 6 · 2013-08-11 06:22:50

Suppose there are k points, no 3 of which are collinear. What is the upper bound on the number of quadrilaterals we can form?

score 11.2k · Answer 7 · 2013-08-14 20:12:40

11.2k

Views

How many non-isomorphic ways a convex polygon with $n + 2$ sides can be cut into triangles?

Published on 14 Aug 2013 - 20:12

score 454 · Answer 8 · 2026-03-26 06:31:02

454

Views

Number of combinations such that each pair of combinations has at most x elements in common?

Published on 26 Mar 2026 - 6:31

score 59 · Answer 9 · 2013-09-26 04:12:36

59

Views

Error correcting binary partition

Published on 26 Sep 2013 - 4:12

score 3.3k · Answer 10 · 2013-10-09 09:54:32

3.3k

Views

Minimum number of horizontal and vertical lines, covering $n$ points in the plane

Published on 09 Oct 2013 - 9:54

score 134 · Answer 11 · 2013-10-11 12:05:37

134

Views

Balanced independent sets & independent domination number

Published on 11 Oct 2013 - 12:05

score 294 · Answer 12 · 2013-10-15 15:52:38

294

Views

Maximal rectangle in a permutation

Published on 15 Oct 2013 - 15:52

score 801 · Answer 13 · 2013-10-18 08:48:07

801

Views

Shadow of a set system

Published on 18 Oct 2013 - 8:48

score 255 · Answer 14 · 2013-10-18 09:18:21

Let $k \le \frac{n}{2}$, and suppose that $F$ is an antichain in $P(n)$ such that every $A \in F$ has $|A| \le k$. Prove that $|F| \le \binom{n}{k}$

score 849 · Answer 15 · 2013-10-21 12:06:01

849

Views

LYM Inequality question

Published on 21 Oct 2013 - 12:06

List Question

Prove that the maximum number of edges in a graph with no even cycles is floor(3(n-1)/2)

Counting the number of subgraphs isomorphic with the following digraph

Show there’s at most $n\choose \left \lfloor\frac{n}{2} \right\rfloor$ subsets $A\subset[n]$ such that $\displaystyle\sum\limits_{i\in{A}} a_i=\alpha$

An extremal combinatorial problem over Finite rings

Has this variation of blocking set been studied before?

Suppose there are k points, no 3 of which are collinear. What is the upper bound on the number of quadrilaterals we can form?

How many non-isomorphic ways a convex polygon with $n + 2$ sides can be cut into triangles?

Number of combinations such that each pair of combinations has at most x elements in common?

Error correcting binary partition

Minimum number of horizontal and vertical lines, covering $n$ points in the plane

Balanced independent sets & independent domination number

Maximal rectangle in a permutation

Shadow of a set system

Let $k \le \frac{n}{2}$, and suppose that $F$ is an antichain in $P(n)$ such that every $A \in F$ has $|A| \le k$. Prove that $|F| \le \binom{n}{k}$

LYM Inequality question

Trending Questions

Popular # Hahtags

Popular Questions