2023
DOI: 10.1080/00927872.2023.2196345
|View full text |Cite
|
Sign up to set email alerts
|

Three-vertex prime graphs and reality of trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(7 citation statements)
references
References 10 publications
0
7
0
Order By: Relevance
“…In that case, we prove that, if G(π) is prime, then every connected subgraph of G(π) is also prime. This not true if G(π) is not a tree, and we give a counter example in [27], which is a paper dedicated to the study of several results concerning trees.…”
Section: Introductionmentioning
confidence: 91%
See 4 more Smart Citations
“…In that case, we prove that, if G(π) is prime, then every connected subgraph of G(π) is also prime. This not true if G(π) is not a tree, and we give a counter example in [27], which is a paper dedicated to the study of several results concerning trees.…”
Section: Introductionmentioning
confidence: 91%
“…The motivation for the present work is the problem of classifying the Drinfeld polynomials whose associated simple modules are prime and similarly for real modules. We will focus here on the former, leaving our first answers regarding the latter to appear in [27]. As it is clear from the above considerations, this is a difficult problem, so our goal is to gradually obtain general results toward such classification.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations