Results 181 to 190 of about 46,626 (239)
Partitioning 3-colored complete graphs into three monochromatic cycles
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core
, 2019 This is an introductory course in algebraic combinatorics. No prior knowledge of combinatorics is expected, but assumes a familiarity with linear algebra and finite groups.
Musiker, Gregg
core
, 2005 Applications of algebra to combinatorics and conversely. Topics include enumeration methods, partially ordered sets and lattices, matching theory, partitions and tableaux, algebraic graph theory, and combinatorics of ...
Postnikov, Alexander
core