On induced subgraphs with odd degrees (Q1336646): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A note on Ramsey numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3852212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the chromatic index of almost all graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3872508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Latest revision as of 10:10, 23 May 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
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
