On the discrepancies of graphs

József Balogh, Béla Csaba, Yifan Jing, András Pluhár

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Article numberP2.12
JournalElectronic Journal of Combinatorics
Volume27
Issue number2
DOIs
StatePublished - 2020

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On the discrepancies of graphs'. Together they form a unique fingerprint.

Cite this