Question

Proof that $|\mathscr{F}_1 \cap \mathscr{F}_2| \geq \frac{|\mathscr{F}_1| \cdot |\mathscr{F}_2|}{2^n}$

score 126 · Answer 1 · 2021-05-28 12:02:36

126

Views

Proof that $|\mathscr{F}_1 \cap \mathscr{F}_2| \geq \frac{|\mathscr{F}_1| \cdot |\mathscr{F}_2|}{2^n}$

Published on 28 May 2021 - 12:02

score 130 · Answer 2 · 2021-06-08 09:52:47

130

Views

If a $3$-uniform hypergraph has ${x \choose 3}$ edges, then it has at most ${x \choose 4}$ copies of $K^3_4$

Published on 08 Jun 2021 - 9:52

score 257 · Answer 3 · 2026-02-23 06:38:41

257

Views

Are there holes in my road map from calculus to malliavin differential geometry, Bayesian hypergraphs, and causal inference?

Published on 23 Feb 2026 - 6:38

score 104 · Answer 4 · 2021-07-01 21:01:26

104

Views

An interesting combinatorial property

Published on 01 Jul 2021 - 21:01

score 207 · Answer 5 · 2021-09-07 15:37:28

207

Views

Generalization of graph where edges relate more than two vertices

Published on 07 Sep 2021 - 15:37

score 45 · Answer 6 · 2021-09-14 05:20:09

45

Views

(graph theory) hypergraph terminologies

Published on 14 Sep 2021 - 5:20

score 100 · Answer 7 · 2021-09-29 09:44:31

100

Views

Hypergraph vertex plus incident edge deletion giving isomorphic subgraphs

Published on 29 Sep 2021 - 9:44

score 110 · Answer 8 · 2021-10-14 00:54:52

110

Views

Edge cover in a regular uniform hypergraph

Published on 14 Oct 2021 - 0:54

score 149 · Answer 9 · 2021-10-22 17:26:27

149

Views

Generalization of (vertex) coloring of a graph to hypergraphs

Published on 22 Oct 2021 - 17:26

score 47 · Answer 10 · 2021-10-23 22:22:48

47

Views

Example of non-(normal) and non-($\tau$-normal) hypergraphs?

Published on 23 Oct 2021 - 22:22

score 23 · Answer 11 · 2021-10-25 16:33:35

Proof clarification from Laszlo Lovasz' Matching Theory, "A hypergraph is balanced iff it does not contain an unbalanced odd circuit.

score 107 · Answer 12 · 2021-11-11 23:47:32

107

Views

Hypergraph variant of handshake problem.

Published on 11 Nov 2021 - 23:47

score 85 · Answer 13 · 2021-11-13 05:25:41

85

Views

What is a hypergraph consisting of one edge leading from itself to itself?

Published on 13 Nov 2021 - 5:25

score 30 · Answer 14 · 2021-11-14 07:48:48

30

Views

How to find the maximum number of edges that exactly contain x vertices in a k-uniform hypergraph？

Published on 14 Nov 2021 - 7:48

score 126 · Answer 15 · 2022-01-31 13:43:05

126

Views

Proving that $81$ $K_4^3$'s cannot be packed in a doubled $K_{11}^3$

Published on 31 Jan 2022 - 13:43

List Question

Proof that $|\mathscr{F}_1 \cap \mathscr{F}_2| \geq \frac{|\mathscr{F}_1| \cdot |\mathscr{F}_2|}{2^n}$

If a $3$-uniform hypergraph has ${x \choose 3}$ edges, then it has at most ${x \choose 4}$ copies of $K^3_4$

Are there holes in my road map from calculus to malliavin differential geometry, Bayesian hypergraphs, and causal inference?

An interesting combinatorial property

Generalization of graph where edges relate more than two vertices

(graph theory) hypergraph terminologies

Hypergraph vertex plus incident edge deletion giving isomorphic subgraphs

Edge cover in a regular uniform hypergraph

Generalization of (vertex) coloring of a graph to hypergraphs

Example of non-(normal) and non-($\tau$-normal) hypergraphs?

Proof clarification from Laszlo Lovasz' Matching Theory, "A hypergraph is balanced iff it does not contain an unbalanced odd circuit.

Hypergraph variant of handshake problem.

What is a hypergraph consisting of one edge leading from itself to itself?

How to find the maximum number of edges that exactly contain x vertices in a k-uniform hypergraph？

Proving that $81$ $K_4^3$'s cannot be packed in a doubled $K_{11}^3$

Trending Questions

Popular # Hahtags

Popular Questions