15 citations · 54 across the 11 of their papers we have counts for
15 papers · 1 filter
Regular decomposition of the edge set of graphs with applications
Béla Csaba
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemerédi in some graph embedding problems. An algorithmic version…
A new graph decomposition method for bipartite graphs
Béla Csaba
Given a sufficiently large and sufficiently dense bipartite graph we present a novel method for decomposing the majority of the edges of into quasirandom graphs…
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…
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…
On embedding degree sequences
Béla Csaba, Bálint Vásárhelyi
Assume that we are given two graphic sequences, and . We consider conditions for and which guarantee that there exists a simple graph realizing s…
On the relation of separability, bandwidth and embedding
Béla Csaba, Bálint Vásárhelyi
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spannin…