The following pages link to Peter Frankl (Q168624):
Displaying 50 items.
- Intersection problems in the \(q\)-ary cube (Q272323) (← links)
- Linear independence, a unifying approach to shadow theorems (Q298330) (← links)
- (Q345133) (redirect page) (← links)
- A stability result for the Katona theorem (Q345134) (← links)
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- Maximal independent sets in the covering graph of the cube (Q385145) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- A new short proof of the EKR theorem (Q423657) (← links)
- On matchings in hypergraphs (Q456292) (← links)
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families (Q458297) (← links)
- On the number of nonnegative sums (Q461732) (← links)
- Two-colorings with many monochromatic cliques in both colors (Q463286) (← links)
- A note on supersaturated set systems (Q499460) (← links)
- Uniform eventown problems (Q499480) (← links)
- A structural result for 3-graphs (Q512589) (← links)
- A note on Huang-Zhao theorem on intersecting families with large minimum degree (Q512607) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- A size-sensitive inequality for cross-intersecting families (Q518199) (← links)
- On the contact dimensions of graphs (Q579284) (← links)
- Embedding the n-cube in lower dimensions (Q581416) (← links)
- On subsets with cardinalities of intersections divisible by a fixed integer (Q585202) (← links)
- Maximal independent sets in bipartite graphs obtained from Boolean lattices (Q607358) (← links)
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle (Q686982) (← links)
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- Multiply union families in \(\mathbb{N}^n\) (Q739052) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Simplices with given 2-face areas (Q757443) (← links)
- Families of finite sets with three intersections (Q761458) (← links)
- Maximum degree and diversity in intersecting hypergraphs (Q777477) (← links)
- On functions of strength t (Q786818) (← links)
- On hypergraphs without two edges intersecting in a given number of vertices (Q787170) (← links)
- Linear dependencies among subsets of a finite set (Q788726) (← links)
- On disjointly representable sets (Q790112) (← links)
- An extremal set theoretical characterization of some Steiner systems (Q790818) (← links)
- An exact result for 3-graphs (Q793054) (← links)
- A new short proof for the Kruskal-Katona theorem (Q793731) (← links)
- How to build a barricade (Q795340) (← links)
- Intersecting Sperner families and their convex hulls (Q796532) (← links)
- Union-free hypergraphs and probability theory (Q798335) (← links)
- A new extremal property of Steiner triple-systems (Q801918) (← links)
- Injection geometries (Q801926) (← links)
- Some geometric applications of the beta distribution (Q804064) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- A note on the jumping constant conjecture of Erdős (Q864899) (← links)
- Binary codes and quasi-symmetric designs (Q912107) (← links)
- An intersection problem for codes (Q922561) (← links)
- A Hilton-Milner theorem for vector spaces (Q976727) (← links)
- On t-distance sets of (0,+-1)-vectors (Q1053023) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
