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

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

zbMATH Keywords

induced subgraph

0 references

odd degree

0 references

reviewed by

Brian Alspach

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A note on Ramsey numbers

0 references

Q3852212

0 references

On the chromatic index of almost all graphs

0 references

Q3872508

0 references

Q3880849

0 references

Identifiers

zbMATH Open document ID

0808.05090

0 references

DOI

10.1016/0012-365X(92)00563-7

0 references

Mathematics Subject Classification ID

05C99

0 references

zbMATH DE Number

681654

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1336646

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Ramsey numbers
@@ Property / cites work: A note on Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic index of almost all graphs
@@ Property / cites work: On the chromatic index of almost all graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3872508
@@ Property / cites work: Q3872508 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank