Supersolvability and freeness for \(\psi\)-graphical arrangements (Q2351029): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersolvable lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5432049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3225387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid orderings of real hyperplane arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE FREENESS OF 3-ARRANGEMENTS / rank
 
Normal rank

Latest revision as of 09:59, 10 July 2024

scientific article
Language Label Description Also known as
English
Supersolvability and freeness for \(\psi\)-graphical arrangements
scientific article

    Statements

    Supersolvability and freeness for \(\psi\)-graphical arrangements (English)
    0 references
    0 references
    0 references
    26 June 2015
    0 references
    graphical arrangement
    0 references
    supersolvable arrangement
    0 references
    free arrangement
    0 references
    chordal graph
    0 references

    Identifiers