Skewincidence
classification
🧮 math.CO
keywords
skewincidencebinarylengthsequencesboundscapacityclasscoordinate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.