Homepage
  • english
  • česky

Přihlášení

Přihlaste se účtem své organizace prostřednictvím eduID.

  • Publications
  • Institute
    • About us
    • Organigram
    • Management
    • Advisory Board
    • Annual reports and budgets
    • Information by 106/1999 Coll.
    • Whistleblowing
    • Exhibition of comp. technology
    • Privacy Policy
  • Research
    • Projects
    • Research subject
    • Awards
    • Best Publication Competition
    • Popularization
  • News
  • Applications
    • Transfer department
    • Applied Informatics
    • Competencies
    • References
  • Events
  • Library
    • About Library
    • Scientific Sources
    • Publications
    • Petr Hájek Library
  • Jobs
    • Job Offers
    • Topics for PhD studies
    • Radius Internships
  • Contacts
  • Departments
  • People
Homepage

Přihlášení

Přihlaste se účtem své organizace prostřednictvím eduID.

english česky
  • Publications
  • Institute
    • About us
    • Organigram
    • Management
    • Advisory Board
    • Annual reports and budgets
    • Information by 106/1999 Coll.
    • Whistleblowing
    • Exhibition of comp. technology
    • Privacy Policy
  • Research
    • Projects
    • Research subject
    • Awards
    • Best Publication Competition
    • Popularization
  • News
  • Applications
    • Transfer department
    • Applied Informatics
    • Competencies
    • References
  • Events
  • Library
    • About Library
    • Scientific Sources
    • Publications
    • Petr Hájek Library
  • Jobs
    • Job Offers
    • Topics for PhD studies
    • Radius Internships
  • Contacts
  • Departments
  • People
  1. Home /
  2. Research /
  3. Projects /
  4. Embedding, Packing and Limits in Graphs

Embedding, Packing and Limits in Graphs

Období: 2019 — 2021
Poskytovatel: GA ČR

Publikace projektu

  • The tree packing conjecture for trees of almost linear maximum degree (2021)
  • On the total versions of 1-2-3-conjecture for graphs and hypergraphs (2022)
  • On sufficient conditions for spanning structures in dense graphs (2023)
  • Towards a hypergraph version of the Pósa-Seymour conjecture (2023)
  • Counting extensions revisited (2019)