Triangulations of the sphere, bitrades and abelian groups (Q484547): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00493-014-2924-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Algebraic Potential Theory on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research problems from the BCC22 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and application of latin bitrades: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latin trades in groups defined on planar triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamming distances of groups and quasi-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3057301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical structure and construction of latin trades / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latin bitrades, dissections of equilateral triangles, and abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Modifications of Some Partial Groupoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3084921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530616 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00493-014-2924-7 / rank
 
Normal rank

Latest revision as of 18:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Triangulations of the sphere, bitrades and abelian groups
scientific article

    Statements

    Triangulations of the sphere, bitrades and abelian groups (English)
    0 references
    0 references
    0 references
    7 January 2015
    0 references
    In the paper, the following two asymptotic results on partitioning the vertices of 2-edge-colored graphs into monochromatic cycles are proved: Theorem 1: For every positive \(\lambda \) and \(\alpha \,\)there exists \(n_{0}(\lambda,\alpha)\) such that if \(G\) is a \(2\)-colored graph on \(n\geq n_{0}\) vertices, then there are at most \(2\alpha \) vertex disjoint monochromatic cycles covering at least \((1-\lambda)n\) vertices of \(G\), where \(\alpha \) is the independence number of \(G\). Theorem 2: For every \(\varepsilon >0,\) there is an \(n_{0}(\varepsilon)\) such that if \(G\) is a \(2\)-colored graph on \(n\geq n_{0}\) vertices and \(\delta (G)>(\frac{3}{4}+\varepsilon)n\), then \(G\) admits two vertex disjoint monochromatic cycles of different colors covering at least \((1-\varepsilon)n \) vertices of \(G\).
    0 references
    2-edge coloring
    0 references
    monochromatic cycles
    0 references
    partitioning vertex set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references