Search results
- 1.0581988 - ÚI 2024 RIV CZ eng C - Conference Paper (international conference)
Davoodi, Akbar - Piguet, Diana - Řada, Hanka - Sanhueza-Matamala, N.
Beyond the Erdős–Sós conjecture.
EUROCOMB’23. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. Brno: MUNI Press, 2023 - (Kráľ, D.; Nešetřil, J.), s. 328-335. E-ISSN 2788-3116.
[EUROCOMB 2023: European Conference on Combinatorics, Graph Theory and Applications /12./. Prague (CZ), 28.08.2023-01.09.2023]
R&D Projects: GA ČR(CZ) GA19-08740S
Institutional support: RVO:67985807
Keywords : conjecture * Erdős-Sós conjecture
OECD category: Pure mathematics
https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-045
Permanent Link: https://hdl.handle.net/11104/0350124File Download Size Commentary Version Access 0581988-aoa.pdf 1 414.2 KB OA CC BY NC ND 4.0 Author´s preprint open-access - 2.0460227 - ÚI 2017 DE eng C - Conference Paper (international conference)
Böttcher, J. - Hladký, Jan - Piguet, Diana - Taraz, A.
An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Dagstuhl: Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, 2014 - (Jansen, K.), s. 490-499. Leibniz International Proceedings in Informatics, 28. ISBN 978-3-939897-74-3. ISSN 1868-8969.
[APPROX-RANDOM 2014. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems /17./ and the International Workshop on Randomization and Computation /18./. Barcelona (ES), 04.09.2014-06.09.2014]
http://drops.dagstuhl.de/opus/volltexte/2014/4718
Permanent Link: http://hdl.handle.net/11104/0260317File Download Size Commentary Version Access a0460227.pdf 1 487.9 KB Publisher’s postprint require