1. bookAHEAD OF PRINT
Detalles de la revista
License
Formato
Revista
eISSN
2083-5892
Primera edición
13 Apr 2013
Calendario de la edición
4 veces al año
Idiomas
Inglés
access type Acceso abierto

-Covering k-Hypergraphs are Quasi-Eulerian

Publicado en línea: 05 Aug 2021
Volumen & Edición: AHEAD OF PRINT
Páginas: -
Recibido: 07 Jan 2021
Aceptado: 28 Jun 2021
Detalles de la revista
License
Formato
Revista
eISSN
2083-5892
Primera edición
13 Apr 2013
Calendario de la edición
4 veces al año
Idiomas
Inglés
Abstract

An Euler tour in a hypergraph H is a closed walk that traverses each edge of H exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of H exactly once. An ℓ-covering k-hypergraph, for 2 ≤ ℓ < k, is a k-uniform hypergraph in which every -subset of vertices lie together in at least one edge.

In this paper we prove that every -covering k-hypergraph, for k ≥ 3, admits an Euler family.

Keywords

MSC 2010

[1] M.A. Bahmanian and M. Šajna, Connection and separation in hypergraphs, Theory Appl. Graphs 2 (2015) Art. 5. https://doi.org/10.20429/tag.2015.02020510.20429/tag.2015.020205Search in Google Scholar

[2] M.A. Bahmanian and M. Šajna, Quasi-eulerian hypergraphs, Electron. J. Combin. 24 (2017) #P3.30. https://doi.org/10.37236/636110.37236/6361Search in Google Scholar

[3] J.A. Bondy and U.S.R. Murty, Graph Theory (Springer-Verlag, London, 2008).10.1007/978-1-84628-970-5Search in Google Scholar

[4] Z. Lonc and P. Naroski, On tours that contain all edges of a hypergraph, Electron. J. Combin. 17 (2010) #R144. https://doi.org/10.37236/41610.37236/416Search in Google Scholar

[5] L. Lovász, The factorization of graphs II, Acta Math. Acad. Sci. Hungar. 23 (1972) 223–246. https://doi.org/10.1007/BF0188991910.1007/BF01889919Search in Google Scholar

[6] M. Šajna and A. Wagner, Triple systems are eulerian, J. Combin. Des. 25 (2017) 185–191. https://doi.org/10.1002/jcd.2153610.1002/jcd.21536Search in Google Scholar

[7] M. Šajna and A. Wagner, Covering hypergraphs are eulerian. arXiv:2101.04561Search in Google Scholar

Artículos recomendados de Trend MD

Planifique su conferencia remota con Sciendo