Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Tripodi, Antoinette"'
Autor:
Lo Faro, Giovanni1 (AUTHOR) lofaro@unime.it, Tripodi, Antoinette1 (AUTHOR) atripodi@unime.it
Publikováno v:
Mathematics (2227-7390). Jun2024, Vol. 12 Issue 12, p1879. 8p.
Autor:
Faro, Giovanni Lo, Tripodi, Antoinette
Let $G$ be a simple finite graph and $G'$ be a subgraph of $G$. A $G'$-design $(X,\cal B)$ of order $n$ is said to be embedded into a $G$-design $(X\cup U,\cal C)$ of order $n+u$, if there is an injective function $f:\cal B\rightarrow \cal C$ such th
Externí odkaz:
http://arxiv.org/abs/2005.11373
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Faro, Giovanni Lo, Tripodi, Antoinette
A solution to the existence problem of G-designs with given subdesigns is known when G is a triangle with p=0,1, or 2 disjoint pendent edges: for p=0, it is due to Doyen and Wilson, the first to pose such a problem for Steiner triple systems; for p=1
Externí odkaz:
http://arxiv.org/abs/1705.00040
Autor:
Lo Faro, Giovanni, Tripodi, Antoinette
Publikováno v:
In Discrete Mathematics July 2021 344(7)
In this article we completely determine the spectrum for uniformly resolvable decompositions of the complete graph K_v into r 1-factors and s classes containing only copies of h-suns.
Externí odkaz:
http://arxiv.org/abs/1503.01690
In this paper we consider the problem concerning the existence of a resolvable G-design of order v and index {\lambda}. We solve the problem for the cases in which G is a connected subgraph of K_4.
Externí odkaz:
http://arxiv.org/abs/1503.00446
In this paper we consider uniformly resolvable decompositions of the complete graph K_v into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all t
Externí odkaz:
http://arxiv.org/abs/1406.4279
Publikováno v:
Quaderni di Matematica, 28(2013), 237-256
It is established that up to isomorphism,there are only one (K_4-e)-design of order 6, three (K_4-e)-designs of order 10 and two (K_4-e)-designs of order 11. As an application of our enumerative results, we discuss the fine triangle intersection prob
Externí odkaz:
http://arxiv.org/abs/1402.6747
Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F
Externí odkaz:
http://arxiv.org/abs/1402.4603