Intersecting families without unique shadow

DOI10.1017/s0963548323000305MaRDI QIDQ6632795

Could not fetch data.

Publication date: 5 November 2024

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

shadowfinite setsintersection

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Turán problems and shadows. II: Trees
• Improved bounds for Erdős' matching conjecture
• Turán problems and shadows. I: Paths and cycles
• The exact bound in the Erdős-Ko-Rado theorem
• Shadows and shifting
• Degrees and matchings
• Solution of a problem of A. Ehrenfeucht and J. Mycielski
• On the maximum number of distinct intersections in an intersecting family
• On the sum of sizes of overlapping families
• The maximum number of cliques in hypergraphs without large matchings
• Intersections and distinct intersections in cross-intersecting families
• Extremal Finite Set Theory
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Turán Problems and Shadows III: Expansions of Graphs
• Intersection theorems for systems of finite sets
• On generalized graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On intersecting families of finite sets

This page was built for publication: Intersecting families without unique shadow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632795)