Finite projective spaces and intersecting hypergraphs

DOI10.1007/BF02579260zbMath0643.05018OpenAlexW2063428595MaRDI QIDQ1101456

Peter Frankl, Zoltan Fueredi

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579260

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Combinatorial aspects of finite geometries (05B25)

Related Items (23)

t-expansive and t-wise intersecting hypergraphs ⋮ Domination in intersecting hypergraphs ⋮ On the kernel of intersecting families ⋮ Symmetric designs as the solution of an extremal problem in combinatorial set theory ⋮ Erdős-Ko-Rado theorem with conditions on the maximal degree ⋮ A generalization of the Katona theorem for cross t-intersecting families ⋮ \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion ⋮ Covering the complete graph by partitions ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ Covering \(t\)-element sets by partitions ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ A general framework for discovering and proving theorems of the Erdős- Ko-Rado type ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ On the measure of intersecting families, uniqueness and stability ⋮ Erdős-Ko-Rado with conditions on the minimum complementary degree ⋮ A note on kernels of intersecting families ⋮ Matchings and covers in hypergraphs ⋮ An Erdős-Ko-Rado theorem for regular intersecting families of octads ⋮ Matching criticality in intersecting hypergraphs ⋮ Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration ⋮ Regular intersecting families ⋮ Covering pairs by \(q^ 2+q+1\) sets ⋮ Intersecting designs from linear programming and graphs of diameter two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An intersection problem with 6 extremes
• Non-trivial intersecting families
• Critical hypergraphs and interesting set-pair systems
• t-expansive and t-wise intersecting hypergraphs
• Maximum degree and fractional matchings in uniform hypergraphs
• On Sperner families satisfying an additional condition
• Families of finite sets satisfying a union condition
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Generalizations of theorems of Katona and Milner
• On a conjecture of milner on k-graphs with non-disjoint edges
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Blocking Sets in Finite Projective Planes
• On intersecting families of finite sets

This page was built for publication: Finite projective spaces and intersecting hypergraphs