Circulant almost cross intersecting families

preprint2020arXivOpen access

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 A∈FA\in \mathcal{F} and B∈GB \in \mathcal{G} if and only if A∩B≠∅A \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) 1≤p≤2t−11 \leq p \leq 2t-1 and 1≤q≤k−2t+11 \leq q \leq k-2t+1. (2) 2t≤p≤t22t \leq p \leq t^2 and any q>0q> 0, where k≥p+qk \geq p+q. (3) pp that is exponential in tt, for large enough kk. Using the first result we show that if k≥4t−3k \geq 4t-3 then C2t−1,k−2t+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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.