Abstract
In 2018 Deza et al. proved the NP-completeness of deciding wether there exists a 3-uniform hypergraph compatible with a given degree sequence. A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. So, it becomes relevant to detect classes of uniform hypergraphs that are reconstructible in polynomial time. In particular, our study concerns 3-uniform hypergraphs that are defined in the NP-completeness proof of Deza et al. Those hypergraphs are constructed starting from a non-increasing sequence s of integers and have very interesting properties. In particular, they are unique, i.e., there do not exist two non isomorphic 3-uniform hypergraphs having the same degree sequence \(d_s\). This property makes us conjecture that the reconstruction of these hypergraphs from their degree sequences can be done in polynomial time. So, we first generalize the computation of the \(d_s\) degree sequences by Deza et al., and we show their uniqueness. We proceed by defining the equivalence classes of the integer sequences determining the same \(d_s\) and we define a (minimal) representative. Then, we find the asymptotic growth rate of the maximal element of the representatives in terms of the length of the sequence, with the aim of generating and then reconstructing them. Finally, we show an example of a unique 3-uniform hypergraph similar to those defined by Deza et al. that does not admit a generating integer sequence s. The existence of this hypergraph makes us conjecture an extended generating algorithm for the sequences of Deza et al. to include a much wider class of unique 3-uniform hypergraphs. Further studies could also include strategies for the identification and reconstruction of those new sequences and hypergraphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Behrens, S., et al.: New results on degree sequences of uniform hypergraphs. Electron. J. Comb. 20(4), P14 (2013)
Berge, C.: Hypergraphs. North-Holland, Amsterdam (1989)
Brlek, S., Frosini, A.: A tomographical interpretation of a sufficient condition on h-graphical sequences. In: Normand, N., Guédon, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 95–104. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-32360-2_7
Colbourne, C.J., Kocay, W.L., Stinson, D.R.: Some NP-complete problems for hypergraph degree sequences. Discrete Appl. Math. 14, 239–254 (1986)
Dewdney, A.K.: Degree sequences in complexes and hypergraphs. Proc. Amer. Math. Soc. 53(2), 535–540 (1975)
Deza, A., Levin, A., Meesum, S.M., Onn, S.: Optimization over degree sequences. SIAM J. Disc. Math. 32(3), 2067–2079 (2018)
Erdös, P., Gallai, T.: Graphs with prescribed degrees of vertices (in Hungarian). Math. Lapok. 11, 264–274 (1960)
Frosini, A., Palma, G., Rinaldi, S.: Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind arrays. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 228–238. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51466-2_20
Frosini, A., Picouleau, C., Rinaldi, S.: On the degree sequences of uniform hypergraphs. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 300–310. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37067-0_26
Hakimi, S.: On realizability of a set of integers as degrees of the vertices of a lineargraph. I. J. Soc. Indust. Appl. Math. 10, 496–506 (1962)
Havel, V.: A remark on the existence of finite graphs (in Czech). Časopis. Pěst. Mat. 80, 477–480 (1955)
Kocay, W., Li, P.C.: On 3-hypergraphs with equal degree sequences. Ars Combinatoria 82, 145–157 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Ascolese, M., Frosini, A., Kocay, W.L., Tarsissi, L. (2021). Properties of Unique Degree Sequences of 3-Uniform Hypergraphs. In: Lindblad, J., Malmberg, F., Sladoje, N. (eds) Discrete Geometry and Mathematical Morphology. DGMM 2021. Lecture Notes in Computer Science(), vol 12708. Springer, Cham. https://doi.org/10.1007/978-3-030-76657-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-76657-3_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76656-6
Online ISBN: 978-3-030-76657-3
eBook Packages: Computer ScienceComputer Science (R0)