Shadows and intersections in vector spaces

DOI10.1016/J.JCTA.2009.10.010zbMATH Open1231.05265OpenAlexW2085573719MaRDI QIDQ1957963FDOQ1957963

Ameera Chowdhury, Balázs Patkós

Publication date: 27 September 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2009.10.010

zbMATH Keywords

shadowintersecting familyvector space[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado&go=Go Erd��s-Ko-Rado]Kruskal-Katona

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersection theorems for systems of finite vector spaces
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős-Ko-Rado from Kruskal-Katona
• Erdös–Ko–Rado Theorem—22 Years Later
• Shadows and intersections: Stability and new proofs
• The Erdős-Ko-Rado theorem for vector spaces
• Independent sets in association schemes
• On Sperner families satisfying an additional condition
• Intersection theorems for vector spaces
• Partitionen abelscher Gruppen
• A Kruskal-Katona type theorem for the linear lattice

Cited In (29)

• On \(q\)-analogues and stability theorems
• A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• Intersecting antichains and shadows in linear lattices
• Theorems of Erdős-Ko-Rado type in geometrical settings
• Title not available (Why is that?)
• The Hilton-Milner theorem for finite affine spaces
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• On forbidden poset problems in the linear lattice
• On r-Cross Intersecting Families of Sets
• A Deza-Frankl type theorem for set partitions
• Kruskal-Katona-type problems via the entropy method
• A cross-intersection theorem for vector spaces based on semidefinite programming
• Erdős-Ko-Rado theorems for set partitions with certain block size
• Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces
• A non-trivial intersection theorem for permutations with fixed number of cycles
• Geometrical Realizations of Shadow Geometries
• A \(t\)-intersecting Hilton-Milner theorem for vector spaces
• Shadows and intersections: Stability and new proofs
• NP by Means of Lifts and Shadows
• Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
• On the rank of higher inclusion matrices
• \(r\)-cross \(t\)-intersecting families for vector spaces
• The query complexity of witness finding
• The Restricted Word Shadow Problem
• The eigenvalue method for cross \(t\)-intersecting families
• Invitation to intersection problems for finite sets
• Shadows under the word-subword relation
• Set Systems with L-Intersections and k-Wise L-Intersecting Families

This page was built for publication: Shadows and intersections in vector spaces

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