Discrepancies of subtrees

DOI10.1007/978-3-031-46826-1_7MaRDI QIDQ6899206zbMATH OpenFDO

Authors Tarun Krishna, Peleg Michaeli, Michail Sarantis, Feng-Lin Wang, Yi-Qing Wang

Publication date 17 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-46826-1_7

zbMATH Keywords

\(r\)-colour discrepancyhigh-dimensional discrepanciesoriented discrepancies

Mathematics Subject Classification ID

Trees (05C05)

Cites work

• A discrepancy version of the Hajnal-Szemerédi theorem
• A note on color-bias Hamilton cycles in dense graphs
• Color‐biased Hamilton cycles in random graphs
• Discrepancies of spanning trees and Hamilton cycles
• Geometric discrepancy. An illustrated guide
• scientific article; zbMATH DE number 881162 (Why is no real title available?)
• Imbalances in k‐colorations
• Multicolour Discrepancies
• On the discrepancies of graphs
• Oriented discrepancy of Hamilton cycles
• Powers of Hamilton cycles of high discrepancy are unavoidable
• Spanning Trees with Many Leaves
• The Erdös discrepancy problem

Cited in

(1)

• Notes on discrepancy and anti-discrepancy in oriented graphs

This page was built for publication: Discrepancies of subtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899206)