Notes on discrepancy and anti-discrepancy in oriented graphs

DOI10.1016/J.DAM.2025.10.019MaRDI QIDQ6883374zbMATH OpenFDO

Authors András London

Publication date 16 December 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.10.019

zbMATH Keywords

anti-discrepancydiscrepancyoriented graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65)

Cites work

• A discrepancy version of the Hajnal-Szemerédi theorem
• A proof of Sumner's universal tournament conjecture for large tournaments
• A zero-sum theorem over Z
• An oriented discrepancy version of Dirac's theorem
• Antidirected Hamilton circuits and paths in tournaments
• Discrepancies of subtrees
• scientific article; zbMATH DE number 3823821 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• Integral boundary points of convex polyhedra
• Note on irregularities of distribution
• On the discrepancies of graphs
• On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
• On totally unimodular matrices
• Oriented discrepancy of Hamilton cycles
• Oriented Hamiltonian cycles in tournaments
• The probabilistic method
• Über die Gleichverteilung von Zahlen mod. Eins.

This page was built for publication: Notes on discrepancy and anti-discrepancy in oriented graphs

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