Zero-sum K_m over Z and the story of K₄
From MaRDI portal
Publication:2000579
Abstract: We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over , Graphs Combin. 32 (2016), 49--63]. For a positive integer , , there are infinitely many values of such that the following holds: There is a weighting function (and hence a weighting function ), such that but, for every copy of in , . On the other hand, for every integer and every weighting function such that , where if (mod ) and if (mod ), there is always a copy of in for which , and the value of is sharp.
Recommendations
Cites work
- scientific article; zbMATH DE number 1000230 (Why is no real title available?)
- scientific article; zbMATH DE number 4137812 (Why is no real title available?)
- scientific article; zbMATH DE number 1286510 (Why is no real title available?)
- A complete characterization of the zero-sum (mod 2) Ramsey numbers
- A simpler proof and a generalization of the zero-trees theorem
- Diagonal forms and zero-sum (mod 2) bipartite Ramsey numbers
- Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs
- On three zero‐sum Ramsey‐type problems
- On zero sum Ramsey numbers: Multiple copies of a graph
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- On zero-trees
- Simplifying the solution of Ljunggren's equation x^ 2+1=2y^ 4
- The Diophantine equation x⁴ - Dy² = 1, II
- The Ljunggren equation revisited
- The uniformity space of hypergraphs and its applications
- Zero-sum problems -- a survey
- Zero-sum square matrices
Cited in
(14)- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- Non-monochromatic triangles in a 2-edge-coloured graph
- On the existence of zero-sum perfect matchings of complete graphs
- Turán‐ and Ramsey‐type results for unavoidable subgraphs
- On the balanceability of some graph classes
- Zero-sum squares in \(\{-1, 1\}\)-matrices with low discrepancy
- When \(K+(n-4)L\) fails to be nef
- Recent developments on unavoidable patterns in 2-colorings of the complete graph
- On small balanceable, strongly-balanceable and omnitonal graphs
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- On balanceable and simply balanceable regular graphs
- On zero-sum spanning trees and zero-sum connectivity
- The balancing number and generalized balancing number of some graph classes
- scientific article; zbMATH DE number 7731181 (Why is no real title available?)
This page was built for publication: Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000579)