Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
k-subsets
Description:
In combinatorics, subsets containing exactly k elements, studied in problems involving arrangements, incidence, and set systems.
Primary topic:
Advanced Combinatorial Mathematics (61%)
Related topics:
Advanced Combinatorial Mathematics (61%),
Limits and Structures in Graph Theory (14%)
OpenAlex ID:
keywords/k-subsets
Intersection theorems with geometric consequences
1981
·
P. Frankl
, R. M. Wilson
·
COMBINATORICA
·
591
Near Perfect Coverings in Graphs and Hypergraphs
1985
·
P. Frankl
, V. Rödl
·
European Journal of Combinatorics
·
203
Erdös–Ko–Rado Theorem—22 Years Later
1983
·
M. Deza
, P. Frankl
·
SIAM Journal on Algebraic and Discrete Methods
·
201
Improved bounds for Erdősʼ Matching Conjecture
2013
·
Peter Frankl
·
Journal of Combinatorial Theory Series A
·
183
PDF
On intersecting families of finite sets
1978
·
Peter Frankl
·
Journal of Combinatorial Theory Series A
·
157
PDF
A new generalization of the Erdős-Ko-Rado theorem
1983
·
Peter Frankl
, Zoltán Füredi
·
COMBINATORICA
·
150
Forbidding just one intersection
1985
·
Peter Frankl
, Zoltán Füredi
·
Journal of Combinatorial Theory Series A
·
129
Non-trivial intersecting families
1986
·
P Frankl
, Z Füredi
·
Journal of Combinatorial Theory Series A
·
90
Universal cycles of k-subsets and k-permutations
1993
·
B.W. Jackson
·
Discrete Mathematics
·
80
PDF
On a problem of Turán
1983
·
K. H. Kim
, F. W. Roush
·
Birkhäuser Basel eBooks
·
64
On families of finite sets no two of which intersect in a singleton
1977
·
Peter Frankl
·
Bulletin of the Australian Mathematical Society
·
60
PDF
Hamiltonian uniform subset graphs
1987
·
Bor-Liang Chen
, Ko-Wei Lih
·
Journal of Combinatorial Theory Series B
·
58
Extremal problems concerning Kneser graphs
1986
·
P Frankl
, Z Füredi
·
Journal of Combinatorial Theory Series B
·
49
A generalization of a theorem of Kruskal
1985
·
Michael Mörs
·
Graphs and Combinatorics
·
49
Note on independent sets in steiner systems
1994
·
Vojtěch Rödl
, Edita Šinajová
·
Random Structures and Algorithms
·
48
On Universal Cycles for k -Subsets of an n -Set
1994
·
Glenn Hurlbert
·
SIAM Journal on Discrete Mathematics
·
46
An Erdős–Ko–Rado theorem for cross t-intersecting families
2014
·
Peter Frankl
, Sang June Lee
, et al.
·
Journal of Combinatorial Theory Series A
·
45
PDF
On the number of k-subsets of a set of n points in the plane
1984
·
Jacob E Goodman
, Richard Pollack
·
Journal of Combinatorial Theory Series A
·
45
Regularity and planarity of token graphs
2017
·
Walter Carballosa
, Ruy Fabila-Monroy
, et al.
·
Discussiones Mathematicae Graph Theory
·
39
PDF
A new short proof of the EKR theorem
2012
·
Peter Frankl
, Zoltán Füredi
·
Journal of Combinatorial Theory Series A
·
38
PDF
A generalization of the Erdös-Ko-Rado theorem on finite set systems
1973
·
A Hajnal
, Bruce Rothschild
·
Journal of Combinatorial Theory Series A
·
38
A size-sensitive inequality for cross-intersecting families
2017
·
Peter Frankl
, Andrey Kupavskii
·
European Journal of Combinatorics
·
37
Finite projective spaces and intersecting hypergraphs
1986
·
P. Frankl
, Z. Füredi
·
COMBINATORICA
·
36
Group Degree Centrality and Centralization in Networks
2020
·
Matjaž Krnc
, Riste Škrekovski
·
Mathematics
·
35
PDF
On weighted sums in abelian groups
1996
·
Y.O. Hamidoune
·
Discrete Mathematics
·
35
PDF
Show more works
View as search
Works count:
219
Citation count:
3,752
Year
Topic
Type