On the discrepancies of graphs

DOI10.37236/8425zbMath1439.05197arXiv2002.11793OpenAlexW3022163360MaRDI QIDQ2181999

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

Publication date: 20 May 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.11793

zbMATH Keywords

discrepancy of Hamilton cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45) Irregularities of distribution, discrepancy (11K38)

Related Items (7)

Powers of Hamilton cycles of high discrepancy are unavoidable ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ Oriented discrepancy of Hamilton cycles ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs ⋮ A Note on Color-Bias Hamilton Cycles in Dense Graphs ⋮ A discrepancy version of the Hajnal–Szemerédi theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the bipartition of graphs
• The isoperimetric number of random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Optimal labelling of a product of two paths
• Cutting a graph into two dissimilar halves
• A Separator Theorem for Planar Graphs
• On the Problem of Partitioning Planar Graphs
• On size Ramsey number of paths, trees, and circuits. I
• Ramsey Theorems for Multiple Copies of Graphs

This page was built for publication: On the discrepancies of graphs