Search results

Records found: 11  
Your query: Author Sysno/Doc.kind = "^cav_un_auth 0323663 zj^"
    1.
    0536118 - MÚ 2022 RIV GB eng J - Journal Article
    Hladký, Jan - Hu, P. - Piguet, Diana
    Tilings in graphons.
    European Journal of Combinatorics. Roč. 93, March (2021), č. článku 103284. ISSN 0195-6698. E-ISSN 1095-9971
    R&D Projects: GA ČR GJ16-07822Y
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840 ; RVO:67985807
    Keywords : extremal graph theory * graphon * tilings
    OECD category: Pure mathematics; Pure mathematics (UIVT-O)
    Impact factor: 0.890, year: 2021
    Method of publishing: Limited access
    https://doi.org/10.1016/j.ejc.2020.103284
    Permanent Link: http://hdl.handle.net/11104/0313945
    FileDownloadSizeCommentaryVersionAccess
    Hladky.pdf6875.5 KBPublisher’s postprintrequire
     
     
    2.
    0524449 - MÚ 2021 RIV US eng J - Journal Article
    Adamaszek, A. - Allen, P. - Grosu, C. - Hladký, Jan
    Almost all trees are almost graceful.
    Random Structures and Algorithms. Roč. 56, č. 4 (2020), s. 948-987. ISSN 1042-9832. E-ISSN 1098-2418
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840
    Keywords : extremal graph theory * graceful tree labelling * tree
    OECD category: Pure mathematics
    Impact factor: 1.131, year: 2020
    Method of publishing: Limited access
    https://doi.org/10.1002/rsa.20906
    Permanent Link: http://hdl.handle.net/11104/0308811
    FileDownloadSizeCommentaryVersionAccess
    Hladky.pdf1992.7 KBPublisher’s postprintrequire
     
     
    3.
    0512063 - MÚ 2020 RIV US eng J - Journal Article
    Doležal, Martin - Hladký, Jan
    Matching polytons.
    Electronic Journal of Combinatorics. Roč. 26, č. 4 (2019), č. článku P4.38. ISSN 1077-8926. E-ISSN 1077-8926
    R&D Projects: GA ČR GA16-07378S
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840
    Keywords : graphon * matching polytope
    OECD category: Pure mathematics
    Impact factor: 0.641, year: 2019
    Method of publishing: Open access
    https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i4p38
    Permanent Link: http://hdl.handle.net/11104/0302266
    FileDownloadSizeCommentaryVersionAccess
    Dolezal3.pdf0489.2 KBPublisher’s postprintrequire
     
     
    4.
    0494407 - ÚI 2019 RIV US eng J - Journal Article
    Hladký, Jan - Hu, P. - Piguet, Diana
    Komlós's Tiling Theorem via Graphon Covers.
    Journal of Graph Theory. Roč. 90, č. 1 (2019), s. 24-45. ISSN 0364-9024. E-ISSN 1097-0118
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Grant - others:GA ČR(CZ) GJ16-07822Y
    Institutional support: RVO:67985807 ; RVO:67985840
    Keywords : extremal graph theory * graphon * graph tiling
    OECD category: Pure mathematics; Pure mathematics (MU-W)
    Impact factor: 0.922, year: 2019
    Method of publishing: Open access
    Permanent Link: http://hdl.handle.net/11104/0287610
    FileDownloadSizeCommentaryVersionAccess
    0494407afin.pdf16255.8 KBPublisher’s postprintrequire
     
     
    5.
    0477079 - MÚ 2018 RIV NL eng J - Journal Article
    Doležal, Martin - Hladký, J. - Hu, P. - Piguet, Diana
    First steps in combinatorial optimization on graphons: matchings.
    Electronic Notes in Discrete Mathematics. Roč. 61, August (2017), s. 359-365. ISSN 1571-0653
    R&D Projects: GA ČR GA16-07378S; GA ČR GJ16-07822Y
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840 ; RVO:67985807
    Keywords : graphon * graph limits * matching * combinatorial optimization
    OECD category: Pure mathematics; Pure mathematics (UIVT-O)
    http://www.sciencedirect.com/science/article/pii/S1571065317301452
    Permanent Link: http://hdl.handle.net/11104/0273478
    FileDownloadSizeCommentaryVersionAccess
    Dolezal2.pdf3251.5 KBPublisher’s postprintrequire
     
     
    6.
    0476966 - MÚ 2018 RIV US eng J - Journal Article
    Doležal, Martin - Hladký, Jan - Máthé, A.
    Cliques in dense inhomogenous random graphs.
    Random Structures and Algorithms. Roč. 51, č. 2 (2017), s. 275-314. ISSN 1042-9832. E-ISSN 1098-2418
    R&D Projects: GA ČR GA16-07378S
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840
    Keywords : inhomogeneous random graphs * clique number
    OECD category: Pure mathematics
    Impact factor: 0.985, year: 2017
    http://onlinelibrary.wiley.com/doi/10.1002/rsa.20715/abstract
    Permanent Link: http://hdl.handle.net/11104/0273372
    FileDownloadSizeCommentaryVersionAccess
    Dolezal1.pdf2444.4 KBPublisher’s postprintrequire
     
     
    7.
    0474810 - MÚ 2018 RIV US eng J - Journal Article
    Hladký, Jan - Komlós, J. - Piguet, Diana - Simonovits, M. - Stein, M. - Szemerédi, E.
    The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition.
    SIAM Journal on Discrete Mathematics. Roč. 31, č. 2 (2017), s. 945-982. ISSN 0895-4801. E-ISSN 1095-7146
    R&D Projects: GA MŠMT(CZ) 1M0545
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840 ; RVO:67985807
    Keywords : extremal graph theory * Loebl–Komlós–Sós conjecture * regularity lemma
    OECD category: Pure mathematics; Pure mathematics (UIVT-O)
    Impact factor: 0.717, year: 2017
    http://epubs.siam.org/doi/10.1137/140982842
    Permanent Link: http://hdl.handle.net/11104/0271761
    FileDownloadSizeCommentaryVersionAccess
    Hladky4.pdf271.3 MBPublisher’s postprintrequire
     
     
    8.
    0474809 - MÚ 2018 RIV US eng J - Journal Article
    Hladký, Jan - Komlós, J. - Piguet, Diana - Simonovits, M. - Stein, M. - Szemerédi, E.
    The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs.
    SIAM Journal on Discrete Mathematics. Roč. 31, č. 2 (2017), s. 983-1016. ISSN 0895-4801. E-ISSN 1095-7146
    R&D Projects: GA MŠMT(CZ) 1M0545
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840 ; RVO:67985807
    Keywords : extremal graph theory * Loebl–Komlós–Sós conjecture * regularity lemma
    OECD category: Pure mathematics; Pure mathematics (UIVT-O)
    Impact factor: 0.717, year: 2017
    http://epubs.siam.org/doi/10.1137/140982854
    Permanent Link: http://hdl.handle.net/11104/0271760
    FileDownloadSizeCommentaryVersionAccess
    Hladky3.pdf71.1 MBPublisher’s postprintrequire
     
     
    9.
    0474808 - MÚ 2018 RIV US eng J - Journal Article
    Hladký, Jan - Komlós, J. - Piguet, Diana - Simonovits, M. - Stein, M. - Szemerédi, E.
    The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result.
    SIAM Journal on Discrete Mathematics. Roč. 31, č. 2 (2017), s. 1072-1148. ISSN 0895-4801. E-ISSN 1095-7146
    R&D Projects: GA MŠMT(CZ) 1M0545
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840 ; RVO:67985807
    Keywords : extremal graph theory * Loebl–Komlós–Sós conjecture * regularity lemma
    OECD category: Pure mathematics; Pure mathematics (UIVT-O)
    Impact factor: 0.717, year: 2017
    http://epubs.siam.org/doi/10.1137/140982878
    Permanent Link: http://hdl.handle.net/11104/0271759
    FileDownloadSizeCommentaryVersionAccess
    Hladky2.pdf52.4 MBPublisher’s postprintrequire
     
     
    10.
    0473849 - MÚ 2018 RIV NL eng J - Journal Article
    Csikvári, P. - Frenkel, P. E. - Hladký, Jan - Hubai, T.
    Chromatic roots and limits of dense graphs.
    Discrete Mathematics. Roč. 340, č. 5 (2017), s. 1129-1135. ISSN 0012-365X. E-ISSN 1872-681X
    EU Projects: European Commission(XE) 628974 - PAECIDM
    Institutional support: RVO:67985840
    Keywords : chromatic root * graph limit * holomorphic moment
    OECD category: Pure mathematics
    Impact factor: 0.738, year: 2017
    http://www.sciencedirect.com/science/article/pii/S0012365X16303661
    Permanent Link: http://hdl.handle.net/11104/0270973
    FileDownloadSizeCommentaryVersionAccess
    Hladky.pdf1416.3 KBPublisher’s postprintrequire
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.

Accept allSettingsReject all