Pages that link to "Item:Q1957963"

The following pages link to Shadows and intersections in vector spaces (Q1957963):

Displaying 26 items.

• The eigenvalue method for cross \(t\)-intersecting families (Q372837) (← links)
• Shadows under the word-subword relation (Q376110) (← links)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
• On \(q\)-analogues and stability theorems (Q408961) (← links)
• Intersecting antichains and shadows in linear lattices (Q549257) (← links)
• Invitation to intersection problems for finite sets (Q739389) (← links)
• A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
• The Hilton-Milner theorem for finite affine spaces (Q1633289) (← links)
• \(r\)-cross \(t\)-intersecting families for vector spaces (Q2084992) (← links)
• Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations (Q2133641) (← links)
• On forbidden poset problems in the linear lattice (Q2290344) (← links)
• Erdős-Ko-Rado theorems for set partitions with certain block size (Q2299629) (← links)
• A Deza-Frankl type theorem for set partitions (Q2341077) (← links)
• The query complexity of witness finding (Q2411034) (← links)
• Theorems of Erdős-Ko-Rado type in geometrical settings (Q2438531) (← links)
• On the rank of higher inclusion matrices (Q2922841) (← links)
• Set Systems with L-Intersections and k-Wise L-Intersecting Families (Q2957064) (← links)
• On <i>r</i>-Cross Intersecting Families of Sets (Q3103624) (← links)
• The Restricted Word Shadow Problem (Q4915245) (← links)
• (Q5148147) (← links)
• A cross-intersection theorem for vector spaces based on semidefinite programming (Q5409116) (← links)
• Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces (Q6041580) (← links)
• A \(t\)-intersecting Hilton-Milner theorem for vector spaces (Q6087875) (← links)
• A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs (Q6162867) (← links)
• Kruskal-Katona-type problems via the entropy method (Q6615764) (← links)