On the existence of zero-sum perfect matchings of complete graphs

DOI10.26493/1855-3974.2573.90DMaRDI QIDQ5881014zbMATH OpenOpenAlexFDO

Authors Teeradej Kittipassorn

Publication date 9 March 2023

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

zero-sum perfect matchingzero-sum spanning pathzero-sum spanning tree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Almost color-balanced perfect matchings in color-balanced complete graphs
• Low weight perfect matchings
• scientific article; zbMATH DE number 844155
• On perfect k-matchings
• A complete characterization of the zero-sum (mod 2) Ramsey numbers

Cites work

• A complete characterization of the zero-sum (mod 2) Ramsey numbers
• Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs
• scientific article; zbMATH DE number 1286510 (Why is no real title available?)
• scientific article; zbMATH DE number 887757 (Why is no real title available?)
• scientific article; zbMATH DE number 3102822 (Why is no real title available?)
• Low weight perfect matchings
• On the Addition of Residue Classes
• On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
• On zero-sum spanning trees and zero-sum connectivity
• The uniformity space of hypergraphs and its applications
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
• Zero-sum problems -- a survey
• Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences

Cited in

(7)

• Perfect matchings in antipodally colored lattice of subsets
• Almost color-balanced perfect matchings in color-balanced complete graphs
• Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation
• Unbalanced spanning subgraphs in edge labeled complete graphs
• The balancing number and generalized balancing number of some graph classes
• On the Existence of Zero-Sum Perfect Matchings of Complete Graphs
• A uniform bound on almost colour-balanced perfect matchings in colour-balanced complete graphs

This page was built for publication: On the existence of zero-sum perfect matchings of complete graphs

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