Skewincidence
Combinatorics
2010-03-23 v1
Abstract
We introduce a new class of problems lying halfway between questions about graph capacity and intersection. We say that two binary sequences x and y of the same length have a skewincidence if there is a coordinate i for which x_i=y_{i+1}=1 or vice versa. We give rather sharp bounds on the maximum number of binary sequences of length n any pair of which has a skewincidence.
Keywords
Cite
@article{arxiv.1003.3986,
title = {Skewincidence},
author = {Gerard Cohen and Emanuela Fachini and Janos Korner},
journal= {arXiv preprint arXiv:1003.3986},
year = {2010}
}