Puncture sets

DOI10.1016/0097-3165(74)90097-1zbMath0289.05005OpenAlexW4206533602MaRDI QIDQ1846873

J. H. Spencer

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90097-1

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items

Extremal problems, partition theorems, symmetric hypergraphs ⋮ An extremal problem in hypergraph coloring ⋮ Bounds for the covering number of a graph ⋮ A deterministic view of random sampling and its use in geometry ⋮ On a set puncturing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Interpolation of functions over a measure space and conjectures about memory
• On partitioning integers into progression free sets
• On a set puncturing problem
• On coverings
• On a combinatorial problem. II
• Hypergraphs and Ramseyian Theorems
• Some Results on Additive Number Theory