On induced subgraphs with odd degrees (Q1336646): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q210144
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Brian Alspach / rank
 
Normal rank

Revision as of 03:23, 11 February 2024

scientific article
Language Label Description Also known as
English
On induced subgraphs with odd degrees
scientific article

    Statements

    On induced subgraphs with odd degrees (English)
    0 references
    0 references
    9 March 1995
    0 references
    The author proves that every graph \(G\) on \(n\) vertices with no isolated vertices contains an induced subgraph \(H\) such that every vertex in \(H\) has odd degree in \(H\) and \(| V(H) | \geq (1-o(1))\sqrt {n/6}\).
    0 references
    induced subgraph
    0 references
    odd degree
    0 references
    0 references

    Identifiers