Long cycles in subgraphs with prescribed minimum degree (Q1183969): Difference between revisions

Let \(n\), \(d\), \(\ell\) be fixed numbers. The authors determine the minimum number of edges in a graph \(G\) on \(n\) vertices such that the subgraph induced by all vertices of degree at least \(d\) contains a cycle of length \(\ell\) (contains cycles of all lengths up to \(\ell)\).

0 references

Mathematics Subject Classification ID

05C38

0 references

0 references

0 references

circumference

0 references

minimum degree

0 references

cycle

0 references

reviewed by

Peter Horák

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3852212

0 references

Q5422499

0 references

Graphs with unavoidable subgraphs with large degrees

0 references

Q4726282

0 references

Maximal circuits of graphs. I

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1183969

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with unavoidable subgraphs with large degrees
+Normal rank
@@ Property / cites work @@
+Q4726282
@@ Property / cites work: Q4726282 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal circuits of graphs. I
@@ Property / cites work: Maximal circuits of graphs. I / rank @@
+Normal rank