Print preview personal data approved: 2023. XII. 22. Publications |
2021
from data base, 2021. XII. 14. |
Balogh József, Csaba Béla, Pluhár András, Treglown Andrew: A discrepancy version of the Hajnal–Szemerédi theorem, COMBINATORICS PROBABILITY & COMPUTING 30: (3) pp. 444-459. type of document: Journal paper/Article language: English URL |
2020
from data base, 2021. XII. 14. |
Balogh József, Csaba Béla, Jing Yifan, Pluhár András: On the Discrepancies of Graphs, ELECTRONIC JOURNAL OF COMBINATORICS 27: (2) p. P2.12. type of document: Journal paper/Article language: English URL |
2019
from data base, 2021. XII. 14. |
Béla Csaba: A new graph decomposition method for bipartite graphs, In: Brodnik, A; Galambos, G; Kavšek, B (szerk.) Zbornik 22. mednarodne multikonference INFORMACIJSKA DRUŽBA – IS 2019 Zvezek I = Proceedings of the 22nd International Multiconference INFORMATION SOCIETY – IS 2019, Volume I, Institut Jožef Stefan (2019) pp. 11-14. type of document: Part of book/Proceedings Paper language: English URL |
2019
from data base, 2021. XII. 14. |
Csaba Béla, Vásárhelyi Bálint: On the Relation of Separability, Bandwidth and Embedding, GRAPHS AND COMBINATORICS 35: pp. 1541-1553. type of document: Journal paper/Article language: English URL |
2019
from data base, 2021. XII. 14. |
Csaba Béla, Nagy-György Judit: Embedding Graphs Having Ore-Degree at Most Five, SIAM JOURNAL ON DISCRETE MATHEMATICS 33: (1) pp. 474-508. type of document: Journal paper/Article language: English URL |
2016
from data base, 2021. XII. 14. |
Csaba Béla, Daniela Kühn, Allan Lo, Deryk Osthus, Andrew Treglown: Proof of the 1-factorization and Hamilton Decomposition Conjectures, American Mathematical Society type of document: Book/Monography number of independent citations: 16 language: English URL |
2011
from data base, 2021. XII. 14. |
József Balogh, Béla Csaba, Wojtek Samotij: Local resilience of almost spanning trees in random graphs, RANDOM STRUCTURES & ALGORITHMS 38: (1-2) pp. 121-139. type of document: Journal paper/Article number of independent citations: 30 language: English URL |
2010
from data base, 2021. XII. 14. |
Csaba Béla, Nagy-György Judit, Ian Levitt, Szemerédi Endre: Tight bounds for embedding bounded degree trees, In: Katona, Gyula; Schrijver, Alexander; Szőnyi, Tamás; Sági, Gábor (szerk.) Fete of Combinatorics and Computer Science, Springer-Verlag; János Bolyai Mathematical Society (2010) pp. 95-137. type of document: Part of book/Szaktanulmány (to be translated) number of independent citations: 7 language: English URL |
2007
from data base, 2021. XII. 14. |
Csaba B: On the Bollobas-Eldridge conjecture for bipartite graphs, COMBINATORICS PROBABILITY & COMPUTING 16: pp. 661-691. type of document: Journal paper/Article number of independent citations: 24 language: English URL |
2003
from data base, 2021. XII. 14. |
Csaba B, Shokoufandeh A, Szemerédi E: Proof of a Conjecture of Bollobas And Eldridge For Graphs of Maximum Degree Three, COMBINATORICA 23: (1) pp. 35-72. type of document: Journal paper/Article number of independent citations: 21 language: English URL |
| Number of independent citations to these publications: | 98 |
|
|