Vector sum-intersection theorems

DOI10.1016/J.DISC.2023.113506zbMATH Open1518.05190arXiv2305.01328WikidataQ122918217 ScholiaQ122918217MaRDI QIDQ6172276FDOQ6172276

Authors: Balázs Patkós, Zsolt Tuza, Máté Vizer 

Publication date: 19 July 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We introduce the following generalization of set intersection via characteristic vectors: for $n,q,s,tge1$ a family $mathcalFsubseteq{0,1,dots,q}^n$ of vectors is said to be emph{$s$-sum $t$-intersecting} if for any distinct $mathbfx,mathbfyinmathcalF$ there exist at least $t$ coordinates, where the entries of $mathbfx$ and $mathbfy$ sum up to at least $s$, i.e. $|i:x_i+y_{i}ges|get$. The original set intersection corresponds to the case $q=1,s=2$. We address analogs of several variants of classical results in this setting: the ErdH{o}s--Ko--Rado theorem and the theorem of Bollob'as on intersecting set pairs.

Full work available at URL: https://arxiv.org/abs/2305.01328

Recommendations

• Intersection theorems for vector spaces
• scientific article; zbMATH DE number 4214176
• A vector-sum theorem in two-dimensional space
• Some intersection theorems
• scientific article; zbMATH DE number 3985382
• An intersection theorem and related problems
• scientific article; zbMATH DE number 5510826
• Intersection theorems under dimension constraints
• scientific article; zbMATH DE number 1409180
• An intersection theorem for topological vector spaces and applications

zbMATH Keywords

intersection theoremsextremal set theory

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal set theory (05D05)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The complete nontrivial-intersection theorem for systems of finite sets
• The complete intersection theorem for systems of finite sets
• A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets
• Intersection problems in the \(q\)-ary cube
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intersection theorems for systems of finite sets
• A generalization of a combinatorial theorem of macaulay
• Title not available (Why is that?)
• The exact bound in the Erdős-Ko-Rado theorem
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős-Ko-Rado from Kruskal-Katona
• The Erdös-Ko-Rado Theorem for Integer Sequences
• On generalized graphs
• The Erdős-Ko-Rado theorem for integer sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• On intersecting families of finite sets
• Inequalities for two set systems with prescribed intersections
• On families of weakly cross-intersecting set-pairs

Cited In (2)

• Intersection theorems for \((- 1, 0, 1)\)-vectors
• A vector-sum theorem in two-dimensional space

This page was built for publication: Vector sum-intersection theorems

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