On small balanceable, strongly-balanceable and omnitonal graphs

DOI10.7151/dmgt.2342zbMath1493.05098arXiv1908.08237OpenAlexW3038815349MaRDI QIDQ2158200

Josef Lauri, Yair Caro, Christina Zarb

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.08237

zbMATH Keywords

edge-colouringbalanceable graphsomnitonal graphszero-sum Ramsey

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ The balancing number and generalized balancing number of some graph classes

Cites Work

• Unnamed Item
• All Ramsey numbers for cycles in graphs
• Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences
• An analogue of the Erdős-Ginzburg-Ziv theorem over \(\mathbb{Z}\)
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
• Zero-sum subsequences in bounded-sum \(\{-r,s\}\)-sequences
• Zero-sum analogues of van der Waerden's theorem on arithmetic progressions
• A note on the Turán function of even cycles
• On maximal paths and circuits of graphs
• The Ramsey number for stripes
• Turán theorems for unavoidable patterns
• Zero-sum Generalized Schur Numbers
• Avoiding zero-sum subsequences of prescribed length over the integers
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)