Schubert graphs, symmetric groups and flags of Boolean lattices (Q1312225): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3488298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5532570 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198785 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3926778 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Buildings of spherical type and finite BN-pairs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3798668 / rank | |||
Normal rank |
Revision as of 12:41, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Schubert graphs, symmetric groups and flags of Boolean lattices |
scientific article |
Statements
Schubert graphs, symmetric groups and flags of Boolean lattices (English)
0 references
24 February 1994
0 references
Given a positive integer \(k\), a Schubert graph of index \(k\) is a simple, connected and \(k\)-regular graph which admits a \(k\)-edge-colouring satisfying the following conditions: (1) any 2-coloured path of length 4 whose colours are not consecutive is closed; (2) the colours of any closed 2-coloured path of length 4 are not consecutive; (3) any 2- coloured path of length 6 is closed: (4) given \(i\in\{1,2,\dots,k\}\), any path with exactly one edge coloured \(i\) and without edges coloured \(j\), for \(j>i\), is open. The author proves that a Schubert graph of index \(k\) is unique up to isomorphism and that this graph is isomorphic to the graph representing the flags of a Boolean lattice. Moreover, the concept of Schubert graphs is used for a new proof of a well-known characterization of symmetric groups.
0 references
Cayley graph
0 references
\(k\)-edge-colouring
0 references
Schubert graph
0 references
path
0 references
flags
0 references
Boolean lattice
0 references
symmetric groups
0 references
0 references