2-factors in dense graphs (Q1917480): Difference between revisions

In 1978, Sauer and Spencer proposed the following conjecture: Any graph with \(n\) vertices and minimum degree at least \({2\over 3} n\) contains every graph \(H\) on \(n\) vertices with maximum degree at most 2. This paper proves that the conjecture is true for sufficiently large \(n\).

0 references

zbMATH Keywords

triangle

0 references

factor

0 references

bipartite

0 references

degree

0 references

0 references

0 references

The strong chromatic number of a graph

0 references

Almost \(H\)-factors in dense graphs

0 references

\(H\)-factors in dense graphs

0 references

Q3852212

0 references

Pancyclic graphs. I

0 references

The tail of the hypergeometric distribution

0 references

On the maximal number of independent circuits in a graph

0 references

On circuits in graphs

0 references

Edge disjoint placement of graphs

0 references

Q4200109

0 references

On the maximum number of independent cycles in a graph

0 references

full work available at URL

https://doi.org/10.1016/0012-365x(95)00242-o

0 references

Identifiers

zbMATH Open document ID

0851.05068

0 references

DOI

10.1016/0012-365X(95)00242-O

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1917480

@@ Property / reviewed by @@
-Zhenhong Liu
@@ Property / reviewed by: Zhenhong Liu / rank @@
-Normal rank
@@ Property / reviewed by @@
+Zhenhong Liu
@@ Property / reviewed by: Zhenhong Liu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic number of a graph
@@ Property / cites work: The strong chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Almost \(H\)-factors in dense graphs
@@ Property / cites work: Almost \(H\)-factors in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(H\)-factors in dense graphs
@@ Property / cites work: \(H\)-factors in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Pancyclic graphs. I
@@ Property / cites work: Pancyclic graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+The tail of the hypergeometric distribution
@@ Property / cites work: The tail of the hypergeometric distribution / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+On circuits in graphs
@@ Property / cites work: On circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4200109
@@ Property / cites work: Q4200109 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of independent cycles in a graph
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(95)00242-o
+Normal rank
@@ Property / OpenAlex ID @@
+W2018839087
@@ Property / OpenAlex ID: W2018839087 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1917480