Béla Csaba

most citedApproximate Multipartite Version of the Hajnal--Szemerédi Theorem

6 citations · 8 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2008★ 6 cited

Approximate Multipartite Version of the Hajnal--Szemerédi Theorem

Bela Csaba

Let $q$ be a positve integer, and $G$ be a $q$ -partite simple graph on $q n$ vertices, with $n$ vertices in each vertex class. Let $δ = \frac{k _{q}}{k _{q} + 1}$ , where $k_{q} = q + O (lo g q)$ . I…

math.CO2007★ 1 cited

Regular spanning subgraphs of bipartite graphs of high minimum degree

Béla Csaba

Let G be a simple balanced bipartite graph on $2 n$ vertices, $δ = δ (G) / n$ , and $ρ = \frac{δ + 2 δ - 1}{2}$ . If $δ > 1/2$ then it has a $⌊ ρ n ⌋$ -regular spanning subgrap…

math.CO2007

On embedding well-separable graphs

Béla Csaba

Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o (n)$ the leftover will have components of size at most $o (n)$ . We prove, that bounded…