Search results

  1. 1.
    0573794 - ÚI 2024 US eng V - Research Report
    Pavez-Signé, M. - Sanhueza-Matamala, Nicolás - Stein, M.
    Towards a hypergraph version of the Pósa-Seymour conjecture.
    Cornell University: Cornell University, 2023. 29 s. arXiv.org e-Print archive, arXiv:2110.09373.
    R&D Projects: GA ČR(CZ) GA19-08740S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/2110.09373
    Permanent Link: https://hdl.handle.net/11104/0344149
    FileDownloadSizeCommentaryVersionAccess
    0573794-arx-oa.pdf1530 KBhttps://arxiv.org/abs/2110.09373Author´s preprintopen-access
     
     
  2. 2.
    0573793 - ÚI 2024 US eng V - Research Report
    Lang, R. - Sanhueza-Matamala, Nicolás
    On sufficient conditions for spanning structures in dense graphs.
    Cornell University: Cornell University, 2023. 68 s. arXiv.org e-Print archive, arXiv:2110.14547.
    R&D Projects: GA ČR(CZ) GA19-08740S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/2110.14547
    Permanent Link: https://hdl.handle.net/11104/0344148
    FileDownloadSizeCommentaryVersionAccess
    0573793-arx-oa.pdf1938.5 KBhttps://arxiv.org/abs/2110.14547Author´s preprintopen-access
     
     
  3. 3.
    0565158 - ÚI 2023 US eng V - Research Report
    Davoodi, Akbar - Maherani, L.
    On the total versions of 1-2-3-conjecture for graphs and hypergraphs.
    Cornell University: Cornell University, 2022. 16 s. arXiv.org e-Print archive, arXiv:2204.13936 [math.CO].
    R&D Projects: GA ČR(CZ) GA19-08740S
    Institutional support: RVO:67985807
    Keywords : vertex coloring * edge weighting * hypergraphs
    OECD category: Pure mathematics
    https://arxiv.org/abs/2204.13936
    Permanent Link: https://hdl.handle.net/11104/0336666
     
     
  4. 4.
    0545299 - ÚI 2022 US eng V - Research Report
    Allen, P. - Böttcher, J. - Clemens, D. - Hladký, Jan - Piguet, Diana - Taraz, A.
    The tree packing conjecture for trees of almost linear maximum degree.
    Cornell University, 2021. 150 s. arXiv.org e-Print archive, arXiv:2106.11720 [math.CO].
    R&D Projects: GA ČR(CZ) GA19-08740S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/2106.11720
    Permanent Link: http://hdl.handle.net/11104/0322028
     
     
  5. 5.
    0523428 - ÚI 2020 US eng V - Research Report
    Šileikis, Matas - Warnke, L.
    Counting extensions revisited.
    Cornell University, 2019. 21 s. arXiv.org e-Print archive, arXiv:1911.03012 [math.CO].
    R&D Projects: GA ČR(CZ) GA19-08740S
    Institutional support: RVO:67985807
    https://arxiv.org/abs/1911.03012
    Permanent Link: http://hdl.handle.net/11104/0307783
    FileDownloadSizeCommentaryVersionAccess
    0523428-pre.pdf0488.3 KBarXiv.orgAuthor´s preprintopen-access
     
     
  6. 6.
    0505984 - ÚI 2020 US eng V - Research Report
    Hladký, Jan - Pelekis, Christos - Šileikis, Matas
    A limit theorem for small cliques in inhomogeneous random graphs.
    Cornell University, 2019. 15 s. arXiv.org e-Print archive, arXiv:1903.10570 [math.CO].
    R&D Projects: GA ČR GJ16-07822Y; GA ČR(CZ) GJ18-01472Y; GA ČR(CZ) GA19-08740S
    Institutional support: RVO:67985840 ; RVO:67985807
    OECD category: Pure mathematics
    https://arxiv.org/abs/1903.10570
    Permanent Link: http://hdl.handle.net/11104/0297301
     
     


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