Anti-Ramsey numbers for cancellative configurations in p-graphs are at most 1 + floor(n/p), with improved bounds ar(n, F4) between roughly 4n²/21 and (5n²-8n)/21.
Schönheim, On maximal systems ofk-tuples,Studia Scientiarum Mathematicarum Hungarica,1(1966), 363-368
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Anti-Ramsey numbers for cancellative configurations in p-graphs
Anti-Ramsey numbers for cancellative configurations in p-graphs are at most 1 + floor(n/p), with improved bounds ar(n, F4) between roughly 4n²/21 and (5n²-8n)/21.