Pregled bibliografske jedinice broj: 1267120
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs // The Electronic journal of combinatorics, 30 (2023), 1; 1, 31 doi:10.37236/10651 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1267120 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs
Autori
Antoniuk, Sylwia ; Kamčev, Nina ; Ruciński, Andrzej
Izvornik
The Electronic journal of combinatorics (1077-8926) 30
(2023), 1;
1, 31
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Hamilton cycle, hypergraph, absoprtion method
Sažetak
We consider a robust variant of Dirac-type problems in k-uniform hypergraphs. For instance, we prove that if H is a k-uniform hypergraph with minimum codegree at least (1/2+c)n, c>0, and n is sufficiently large, then any edge coloring satisfying appropriate local constraints yields a properly colored tight Hamilton cycle in H. Similar results for loose cycles are also shown.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb
Profili:
Nina Kamčev
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
