Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2007.10.029
@@ Property / DOI: 10.1016/j.dam.2007.10.029 / rank @@
-Normal rank
@@ Property / author @@
+Yu-qing Lin
@@ Property / author: Yu-qing Lin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2007.10.029
+Normal rank
@@ Property / OpenAlex ID @@
+W2172575773
@@ Property / OpenAlex ID: W2172575773 / rank @@
+Normal rank
@@ Property / cites work @@
+On the girth of extremal graphs without shortest cycles
+Normal rank
@@ Property / cites work @@
+On the Minimum Order of Extremal Graphs to have a Prescribed Girth
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for λ′‐optimality in graphs with girth <i>g</i>
+Normal rank
@@ Property / cites work @@
+Q3624955
@@ Property / cites work: Q3624955 / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesis of reliable networks - a survey
@@ Property / cites work: Synthesis of reliable networks - a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Circulants and their connectivities
@@ Property / cites work: Circulants and their connectivities / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly pancyclic graphs
@@ Property / cites work: Weakly pancyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Pancyclic graphs. I
@@ Property / cites work: Pancyclic graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+On Graphs that do not Contain a Thomsen Graph
@@ Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs without four-cycles
@@ Property / cites work: Graphs without four-cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4085754
@@ Property / cites work: Q4085754 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing a conditional edge-connectivity of a graph
+Normal rank
@@ Property / cites work @@
+Maximally connected digraphs
@@ Property / cites work: Maximally connected digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Turán number for the hexagon
@@ Property / cites work: On the Turán number for the hexagon / rank @@
+Normal rank
@@ Property / cites work @@
+Q4024328
@@ Property / cites work: Q4024328 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on cycle lengths in graphs
@@ Property / cites work: A note on cycle lengths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity of Regular Directed Graphs with Small Diameters
+Normal rank
@@ Property / cites work @@
+Extremal graphs without three‐cycles or four‐cycles
+Normal rank
@@ Property / cites work @@
+On the structure of extremal graphs of high girth
@@ Property / cites work: On the structure of extremal graphs of high girth / rank @@
+Normal rank
@@ Property / cites work @@
+A new series of dense graphs of high girth
@@ Property / cites work: A new series of dense graphs of high girth / rank @@
+Normal rank
@@ Property / cites work @@
+Q3312262
@@ Property / cites work: Q3312262 / rank @@
+Normal rank
@@ Property / cites work @@
+Using simulated annealing to construct extremal graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2007.10.029
@@ Property / DOI: 10.1016/J.DAM.2007.10.029 / rank @@
+Normal rank