On the discrepancies of graphs
Combinatorics
2020-02-28 v1
Abstract
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph , labels are assigned to the edges, and we consider a family of (spanning) subgraphs of certain types, among others spanning trees, Hamiltonian cycles. As usual, we seek for bounds on the sum of the labels that hold for all elements of , for every labeling.
Cite
@article{arxiv.2002.11793,
title = {On the discrepancies of graphs},
author = {József Balogh and Béla Csaba and Yifan Jing and András Pluhár},
journal= {arXiv preprint arXiv:2002.11793},
year = {2020}
}
Comments
15 pages