Problems in Zero-Sum Combinatorics

DOI10.1112/S0024610797005152MaRDI QIDQ4357296zbMATH OpenOpenAlexFDO

Authors Yair Caro

Publication date 17 November 1997

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s0024610797005152

zbMATH Keywords

Ramsey theoryedge coloringzero-sumTurán extremal theory

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• Zero-sum partition theorems for graphs
• On three zero‐sum Ramsey‐type problems
• On the algorithmic complexity of zero-sum edge-coloring

Cited in

(8)

• Zero-sum problems and coverings by proper cosets
• Zero-sum problems -- a survey
• On the algorithmic complexity of zero-sum edge-coloring
• Two zero-sum problems and multiple properties
• Zero-sum partition theorems for graphs
• Tight bounds for divisible subdivisions
• Zero-sum problems in finite Abelian groups: a survey
• Zero sum cycles in complete digraphs

This page was built for publication: Problems in Zero-Sum Combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4357296)