1965/10/01 by Esther Szekeres, G Szekeres · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computer science #Discrete mathematics #Enhanced Data Rates for GSM Evolution #Graph #Graph theory and applications #Mathematics #Node (physics) #Philosophy #Physics #Property (philosophy) #Set (abstract data type) #Telecommunications #graph theory and CDMA systems
paper · doi:10.2307/3612854
openalex publication_date 1965/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
Let G n be a complete directed graph of order n . That is, G n has n nodes and every pair of nodes is connected by exactly one directed edge. We say, G n has the property S k (after Schütte who posed the problem) if for every set of k nodes there is at least one node in G n from which the edges go out to the given k nodes.