Intersecting Families of Separated Sets

By John M. Talbot. 2002

68 citations recorded by the source corpus.

A set A ⊆ {1,2,…,n} is said to be k‐separated if, when considered on the circle, any two elements of A are separated by a gap of size at least k.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/f17c29512e06a30702524e468484430c2cea7e04

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Peter Borg

In Discrete Mathematics and Combinatorics

1. Peter Borg

Citations in the corpus

• Extremal t‐intersecting sub‐families of hereditary families (2009, background): “Solving the problem in [26], Talbot [44] proved the following result.”