论文标题
关于图的差异
On the discrepancies of graphs
论文作者
论文摘要
在文献中，即使在图理论中，差异的概念也用于多种情况。在这里，对于图$ g $，$ \ { - 1，1，1 \} $标签已分配给边缘，我们考虑了某些类型的（Spanning）子图的家庭$ \ Mathcal {s} _g $（Spanning），以及其他类型的跨越树木，汉密尔顿周期。像往常一样，我们在每个标签上都寻求有关$ \ mathcal {s} _g $的所有元素的标签的总和。
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ 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 $\mathcal{S}_G$, for every labeling.
