TY - JOUR
T1 - On the discrepancies of graphs
AU - Balogh, József
AU - Csaba, Béla
AU - Jing, Yifan
AU - Pluhár, András
N1 - Funding Information:
∗The first author is partially supported by NSF Grant DMS-1500121 and DMS-1764123, Arnold O. Beckman Research Award (UIUC Campus Research Board RB 18132) and the Langan Scholar Fund (UIUC). †The second author was partially supported by the Ministry of Human Capacities, Hungary, Grant 20391-3/2018/FEKUSTRAT. ‡The second and fourth authors were partially supported by the NKFIH grants KH 18 129597 and SNN 117879.
PY - 2020
Y1 - 2020
N2 - 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 SG 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 SG, for every labeling.
AB - 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 SG 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 SG, for every labeling.
UR - http://www.scopus.com/inward/record.url?scp=85083966231&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85083966231&partnerID=8YFLogxK
U2 - 10.37236/8425
DO - 10.37236/8425
M3 - Article
AN - SCOPUS:85083966231
VL - 27
JO - Electronic Journal of Combinatorics
JF - Electronic Journal of Combinatorics
SN - 1077-8926
IS - 2
M1 - P2.12
ER -