English

Circulant almost cross intersecting families

Combinatorics 2020-05-19 v1 Discrete Mathematics

Abstract

Let F\mathcal{F} and G\mathcal{G} be two tt-uniform families of subsets over [k]={1,2,...,k}[k] = \{1,2,...,k\}, where F=G|\mathcal{F}| = |\mathcal{G}|, and let CC be the adjacency matrix of the bipartite graph whose vertices are the subsets in F\mathcal{F} and G\mathcal{G}, and there is an edge between AFA\in \mathcal{F} and BGB \in \mathcal{G} if and only if ABA \cap B \neq \emptyset. The pair (F,G)(\mathcal{F},\mathcal{G}) is qq-almost cross intersecting if every row and column of CC has exactly qq zeros. We consider qq-almost cross intersecting pairs that have a circulant intersection matrix Cp,qC_{p,q}, determined by a column vector with p>0p > 0 ones followed by q>0q > 0 zeros. This family of matrices includes the identity matrix in one extreme, and the adjacency matrix of the bipartite crown graph in the other extreme. We give constructions of pairs (F,G)(\mathcal{F},\mathcal{G}) whose intersection matrix is Cp,qC_{p,q}, for a wide range of values of the parameters pp and qq, and in some cases also prove matching upper bounds. Specifically, we prove results for the following values of the parameters: (1) 1p2t11 \leq p \leq 2t-1 and 1qk2t+11 \leq q \leq k-2t+1. (2) 2tpt22t \leq p \leq t^2 and any q>0q> 0, where kp+qk \geq p+q. (3) pp that is exponential in tt, for large enough kk. Using the first result we show that if k4t3k \geq 4t-3 then C2t1,k2t+1C_{2t-1,k-2t+1} is a maximal isolation submatrix of size k×kk\times k in the 0,10,1-matrix Ak,tA_{k,t}, whose rows and columns are labeled by all subsets of size tt of [k][k], and there is a one in the entry on row xx and column yy if and only if subsets x,yx,y intersect.

Keywords

Cite

@article{arxiv.2005.07907,
  title  = {Circulant almost cross intersecting families},
  author = {Michal Parnas},
  journal= {arXiv preprint arXiv:2005.07907},
  year   = {2020}
}
R2 v1 2026-06-23T15:35:21.777Z