Mario Gionfriddo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Mario Gionfriddo has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Salvatore Milici
Università di Catania
14 shared publications - Elena Guardo
Dipartimento di Matematica e Informatica, Università di Catania, Catania, Italy
6 shared publications - Antoinette Tripodi
Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
5 shared publications - Giovanni Lo Faro
Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
5 shared publications Lorenzo Milazzo
Univ Catania, Dipartimento Matemat & Informat, Viale A Doria 6, I-95125 Catania, Italy
5 shared publications- Lucia Marino
Università di Catania
5 shared publications
Latest Publications
- Open Access
- 18 October 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 14 (1) , 1-9
On $(n-1)$-bicolorable Steiner triple systems of order $2^n-7$A Steiner triple system STS of order $v$ is a hypergraph of rank 3, with $v$ vertices and such that every 2-subset of vertices has degree 1. In this paper we construct STS$(2v+7)$ containing subsystems STS of order $v$. This construction allows us to obtain, for any $n\ge 5$, $(n-1)$-bicolorable systems STS$(2^n-7)$ having a maximal independent set of largest cardinality. Received: 04 May 2026 | Accepted: 18 June 2026- 18 October 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 14 (1) , 1-9
Open AccessOn $(n-1)$-bicolorable Steiner triple systems of order $2^n-7$A Steiner triple system STS of order $v$ is a hypergraph of rank 3, with $v$ vertices and such that every 2-subset of vertices has degree 1. In this paper we construct STS$(2v+7)$ containing subsystems STS of order $v$. This construction allows us to obtain, for any $n\ge 5$, $(n-1)$-bicolorable systems STS$(2^n-7)$ having a maximal independent set of largest cardinality. Received: 04 May 2026 | Accepted: 18 June 2026 - 6 May 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 13 (2) , 151-177
On the spectrum of some cyclically and transitively oriented H-designs
This paper investigates oriented ℱ-designs on complete uniform hypergraphs of rank 3, focusing in particular on the spectrum of existence and on the construction of some cyclically and transitively oriented P(3)(2, 4)-designs and P(3)(1, 5)-designs, namely BCP(3)(2, 4)-designs and BCP(3)(1, 5)-designs for cyclically oriented ones, BTP(3)(2, 4)-designs and BTP(3)(1, 5)-designs for transitively oriented ones. In the appendix, we provide the Python code to obtain the explicit realization of the BCP(3)(2, 4)-designs on v vertices. Moreover, the structure of this algorithm, with suitable modifications, can be generalized to the other three structures as well.
- 6 May 2026
- Published by iPeak Academy Ltd. in Journal of Algebra Combinatorics Discrete Structures and Applications
- Vol. 13 (2) , 151-177
On the spectrum of some cyclically and transitively oriented H-designs
This paper investigates oriented ℱ-designs on complete uniform hypergraphs of rank 3, focusing in particular on the spectrum of existence and on the construction of some cyclically and transitively oriented P(3)(2, 4)-designs and P(3)(1, 5)-designs, namely BCP(3)(2, 4)-designs and BCP(3)(1, 5)-designs for cyclically oriented ones, BTP(3)(2, 4)-designs and BTP(3)(1, 5)-designs for transitively oriented ones. In the appendix, we provide the Python code to obtain the explicit realization of the BCP(3)(2, 4)-designs on v vertices. Moreover, the structure of this algorithm, with suitable modifications, can be generalized to the other three structures as well.
- Open Access
- 2 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 850
Some Constructions of Steiner Triple Systems of Type v⟶2v + 1 + 6k
A Steiner Triple System () of order v is a hypergraph that is uniform of rank 3 and has order v, such that every 2-subset of X has degree 1. In this paper, we present some constructions of of type and , examining all possible cases.- 2 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (5) , 850
Open AccessSome Constructions of Steiner Triple Systems of Type v⟶2v + 1 + 6k
A Steiner Triple System () of order v is a hypergraph that is uniform of rank 3 and has order v, such that every 2-subset of X has degree 1. In this paper, we present some constructions of of type and , examining all possible cases. - Open Access
- 22 December 2025
- Published by MDPI AG in Mathematics
- Vol. 14 (1) , 42
Some Problems and Conjectures About Voloshin Triple Systems
In this paper we give a short survey of Voloshin Triple Systems, which are Steiner Triple Systems with a vertex colouring which colour the blocks using exactly two colours. We also provide two conjectures about obtained by the construction , starting from . Finally, we point out some open problems about Steiner Systems with a similar vertex colouring, which could provide similar conjectures.- 22 December 2025
- Published by MDPI AG in Mathematics
- Vol. 14 (1) , 42
Open AccessSome Problems and Conjectures About Voloshin Triple Systems
In this paper we give a short survey of Voloshin Triple Systems, which are Steiner Triple Systems with a vertex colouring which colour the blocks using exactly two colours. We also provide two conjectures about obtained by the construction , starting from . Finally, we point out some open problems about Steiner Systems with a similar vertex colouring, which could provide similar conjectures. - Open AccessA construction of Steiner Triple Systems of type $v\longrightarrow 2v+7$A Steiner Triple System ($STS$) of order $v$ is a hypergraph uniform of rank 3, with $v$ vertices and such that every 2-subset of vertices has degree 1. In this paper we give a construction, by difference method, of type $v\longrightarrow 2v+7$ with $v=2^n-7$, which means that, given an $STS$ of order $v=2^n -7$, it is always possible to construct an $STS$ of order $2^{n+1}-7$. Through this construction it is possible to get for any $n\ge 5$ an $STS(2^n-7)$ with a maximal independent set of maximal cardinality and which is $(n-1)$-bicolorable.Open AccessA construction of Steiner Triple Systems of type $v\longrightarrow 2v+7$A Steiner Triple System ($STS$) of order $v$ is a hypergraph uniform of rank 3, with $v$ vertices and such that every 2-subset of vertices has degree 1. In this paper we give a construction, by difference method, of type $v\longrightarrow 2v+7$ with $v=2^n-7$, which means that, given an $STS$ of order $v=2^n -7$, it is always possible to construct an $STS$ of order $2^{n+1}-7$. Through this construction it is possible to get for any $n\ge 5$ an $STS(2^n-7)$ with a maximal independent set of maximal cardinality and which is $(n-1)$-bicolorable.
- Open Access
- 25 June 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (13) , 1968
Construction of S(3) (2, 3)-Designs of Any Index
Let be a uniform hypergraph of rank 3. A hyperstar of centre is a 3-uniform hypergraph with three hyperedges, all having the centre in common, with x and y of degree 3 and the remaining vertices of degree 1. In this paper, we determine the spectrum of -designs for any index .- 25 June 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (13) , 1968
Open AccessConstruction of S(3) (2, 3)-Designs of Any Index
Let be a uniform hypergraph of rank 3. A hyperstar of centre is a 3-uniform hypergraph with three hyperedges, all having the centre in common, with x and y of degree 3 and the remaining vertices of degree 1. In this paper, we determine the spectrum of -designs for any index . - Open Access
- 12 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 408
Locally Balanced G-Designs
Let G be a graph and let be the complete graph of order n. A G-design is a decomposition of the set of edges of in graphs isomorphic to G, which are called blocks. It is well-known that a G-design is balanced if all the vertices are contained in the number of blocks of G. In this paper, the definition of locally balanced G-design is given, generalizing the existing concepts related to balanced designs. Further, locally balanced G-designs are studied in the cases in which and , determining the spectrum.- 12 January 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (2) , 408
Open AccessLocally Balanced G-Designs
Let G be a graph and let be the complete graph of order n. A G-design is a decomposition of the set of edges of in graphs isomorphic to G, which are called blocks. It is well-known that a G-design is balanced if all the vertices are contained in the number of blocks of G. In this paper, the definition of locally balanced G-design is given, generalizing the existing concepts related to balanced designs. Further, locally balanced G-designs are studied in the cases in which and , determining the spectrum. - Open AccessA short proof of the conjecture of Erdös--Straus for every $n\equiv 13 \textrm{ mod }24$The Erd\"{o}s--Straus conjecture states that the equation $\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$ has positive integer solutions $x,y,z$ for every postive integers $n\geq 2$. In this short note we find explicity the solutions of the famous conjecture for the case $n\equiv13 \textrm{ mod } 24.$Open AccessA short proof of the conjecture of Erdös--Straus for every $n\equiv 13 \textrm{ mod }24$The Erd\"{o}s--Straus conjecture states that the equation $\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$ has positive integer solutions $x,y,z$ for every postive integers $n\geq 2$. In this short note we find explicity the solutions of the famous conjecture for the case $n\equiv13 \textrm{ mod } 24.$
- 10 August 2021
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 21 (1) , #P1.02
Complex uniformly resolvable decompositions of K_v
In this paper we consider complex uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set ℋ and at least one parallel class is present from each graph of ℋ. We completely determine the spectrum for the cases ℋ = {K2, P3, K3}, ℋ = {P4, C4}, and ℋ = {K2, P4, C4}.
- 10 August 2021
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 21 (1) , #P1.02
Complex uniformly resolvable decompositions of K_v
In this paper we consider complex uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the same graph from a given set ℋ and at least one parallel class is present from each graph of ℋ. We completely determine the spectrum for the cases ℋ = {K2, P3, K3}, ℋ = {P4, C4}, and ℋ = {K2, P4, C4}.
- 23 June 2021
- Published by Taru Publications in Journal of Interdisciplinary Mathematics
- Vol. 24 (8) , 2307-2312
A short proof of Erdös–Straus conjecture for everyn≡ 13 mod 24
Rhe Erdös–Straus conjecture states that the equation has positive integer solutions x, y, z for every positive integers n ≥ 2. In this short note we find explicitly the solutions of the famous conjecture for the case n ≡ 13 mod 24.
- 23 June 2021
- Published by Taru Publications in Journal of Interdisciplinary Mathematics
- Vol. 24 (8) , 2307-2312
A short proof of Erdös–Straus conjecture for everyn≡ 13 mod 24
Rhe Erdös–Straus conjecture states that the equation has positive integer solutions x, y, z for every positive integers n ≥ 2. In this short note we find explicitly the solutions of the famous conjecture for the case n ≡ 13 mod 24.