  Typ výsledku
Autor celku
Název celku(Celkem 5 zázn.)
|
|---|
| Hladký, Jan, Schacht, Mathias. Note on bipartite graph tilings. SIAM Journal on Discrete Mathematics, 2010, sv. 24, s. 357–362. ISSN 0895-4801. IF 0.799. [Článek v časopise] |
| Kral, Daniel, Serra, Oriol, Vena Lluis. A combinatorial proof of the Removal Lemma for groups. Journal of Combinatorial Theory Series A, 2009, sv. 116, s. 971–978. ISSN 0097-3165. IF 0.922. [Článek v časopise] |
| Hladký, Jan; Piguetová Diana, Název: Loebl-Komlós-Sós Conjecture: dense case Abstrakt: We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For any q>0 there exists a number $n_0\in \mathbb{N}$ such that for any n>n_0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of degree at least k, then any tree of order k+1 is a subgraph of G. 76 stran zasláno k publikaci do Journal of Combinatorial Theory, series B. [Jiný výsledek] |
| Hladký, Jan; Schacht, Mathias, Název: Note on bipartite graph tilings Abstrakt: Let s<t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n=k(s+t), which ensure that G has a K_{s,t}-factor. Exact result for large n is given. Our result extends the work of Zhao, who determined the minimum degree treshold which guarantees that a bipartite graph has a K_{s,s}-factor. 6 stran zasláno k publikaci do SIAM Journal on Discrete Mathematics [Jiný výsledek] |
| Kráľ, Daniel; Serra, Oriol; Vena, Luis, Název: A Combinatorial Proof of the Removal Lemma for Groups Abstrakt: Green [Geometric and Functional Analysis 15 (2005), 340–376] established a version of the Szemerédi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his Removal Lemma that allows us to extend its statement to all finite groups. We also discuss possible extensions of the Removal Lemma to systems of equations. zasláno k publikaci do Journal of Combinatorial Theory, series A. [Jiný výsledek] |
