In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$ with each edge labelled $-1$ or $1$, we consider a family $\mathcal{S}_G$ of subgraphs of a certain type, such as spanning trees or Hamiltonian cycles. As usual, we seek for bounds on the sum of the labels that hold for all elements of $\mathcal{S}_G$, for every labeling.
@article{10_37236_8425,
author = {J\'ozsef Balogh and B\'ela Csaba and Yifan Jing and Andr\'as Pluh\'ar},
title = {On the discrepancies of graphs},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {2},
doi = {10.37236/8425},
zbl = {1439.05197},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8425/}
}
TY - JOUR
AU - József Balogh
AU - Béla Csaba
AU - Yifan Jing
AU - András Pluhár
TI - On the discrepancies of graphs
JO - The electronic journal of combinatorics
PY - 2020
VL - 27
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/8425/
DO - 10.37236/8425
ID - 10_37236_8425
ER -
%0 Journal Article
%A József Balogh
%A Béla Csaba
%A Yifan Jing
%A András Pluhár
%T On the discrepancies of graphs
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/8425/
%R 10.37236/8425
%F 10_37236_8425
József Balogh; Béla Csaba; Yifan Jing; András Pluhár. On the discrepancies of graphs. The electronic journal of combinatorics, Tome 27 (2020) no. 2. doi: 10.37236/8425
