8 research outputs found

    H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.

    Get PDF
    In this paper we prove that if DD is a loopless asymmetric 3-quasi-transitive arc-coloured digraph having its arcs coloured with the vertices of a given digraph HH, and if in DD every C4C_4 is an HH-cycle and every C3C_3 is a quasi-HH-cycle, then DD has an HH-kernel

    Tournaments with kernels by monochromatic paths

    Get PDF
    In this paper we prove the existence of kernels by monochromatic paths in m-coloured tournaments in which every cyclic tournament of order 3 is atmost 2-coloured in addition to other restrictions on the colouring ofcertain subdigraphs. We point out that in all previous results on kernelsby monochromatic paths in arc coloured tournaments, certain smallsubstructures are required to be monochromatic or monochromatic with atmost one exception, whereas here we allow up to three colours in two smallsubstructures

    Abstract polytopes and projective lines, the chiral case

    No full text
    Non UBCUnreviewedAuthor affiliation: UNAMOthe

    Flag-transitive symmetric designs

    No full text
    EThOS - Electronic Theses Online ServiceGBUnited Kingdo

    Tournaments with kernels by monochromatic paths

    Get PDF
    In this paper we prove the existence of kernels by monochromatic paths in m-coloured tournaments in which every cyclic tournament of order 3 is atmost 2-coloured in addition to other restrictions on the colouring ofcertain subdigraphs. We point out that in all previous results on kernelsby monochromatic paths in arc coloured tournaments, certain smallsubstructures are required to be monochromatic or monochromatic with atmost one exception, whereas here we allow up to three colours in two smallsubstructures

    H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.

    Get PDF
    In this paper we prove that if DD is a loopless asymmetric 3-quasi-transitive arc-coloured digraph having its arcs coloured with the vertices of a given digraph HH, and if in DD every C4C_4 is an HH-cycle and every C3C_3 is a quasi-HH-cycle, then DD has an HH-kernel

    Chiral polyhedra and projective lines

    No full text
    info:eu-repo/semantics/publishe
    corecore