Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
From MaRDI portal
Publication:2000579
DOI10.1007/s00373-019-02040-3zbMath1416.05186arXiv1708.09777OpenAlexW3007661098MaRDI QIDQ2000579
Amanda Montejano, Yair Caro, Adriana Hansberg
Publication date: 28 June 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09777
Quadratic and bilinear Diophantine equations (11D09) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Signed and weighted graphs (05C22)
Related Items (10)
On the existence of zero-sum perfect matchings of complete graphs ⋮ On small balanceable, strongly-balanceable and omnitonal graphs ⋮ On the balanceability of some graph classes ⋮ Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy ⋮ Turán‐ and Ramsey‐type results for unavoidable subgraphs ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ The balancing number and generalized balancing number of some graph classes ⋮ Unnamed Item ⋮ Non-monochromatic triangles in a 2-edge-coloured graph ⋮ On zero-sum spanning trees and zero-sum connectivity
Cites Work
- Simplifying the solution of Ljunggren's equation \(x^ 2+1=2y^ 4\)
- A simpler proof and a generalization of the zero-trees theorem
- The uniformity space of hypergraphs and its applications
- A complete characterization of the zero-sum (mod 2) Ramsey numbers
- Zero-sum square matrices
- Zero-sum problems -- a survey
- Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers
- Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs
- The Diophantine equation x⁴ - Dy² = 1, II
- The Ljunggren equation revisited
- On zero-trees
- On zero sum Ramsey numbers: Multiple copies of a graph
- On three zero‐sum Ramsey‐type problems
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
