3 papers
math.CO2021
Graph clustering via generalized colorings
András London, Ryan R. Martin, András Pluhár
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense…
math.CO2020
On the discrepancies of graphs
József Balogh, Béla Csaba, Yifan Jing +1
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…
math.CO2020
A discrepancy version of the Hajnal-Szemerédi theorem
József Balogh, Béla Csaba, András Pluhár +1
A perfect -tiling in a graph is a collection of vertex-disjoint copies of the clique in covering every vertex of . The famous Hajnal--Szemerédi theorem determ…