The typical structure of graphs without given excluded subgraphs (Q3633015): Difference between revisions

@@ Property / DOI @@
-.1002/rsa.20242
@@ Property / DOI: 10.1002/rsa.20242 / rank @@
-Normal rank
@@ Property / author @@
-Miklós Simmonovits
@@ Property / author: Miklós Simmonovits / rank @@
-Normal rank
@@ Property / author @@
+Miklós Simmonovits
@@ Property / author: Miklós Simmonovits / 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.1002/rsa.20242
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.20242 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4236586398
@@ Property / OpenAlex ID: W4236586398 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of graphs without forbidden subgraphs
@@ Property / cites work: The number of graphs without forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
+Normal rank
@@ Property / DOI @@
+.1002/RSA.20242
@@ Property / DOI: 10.1002/RSA.20242 / rank @@
+Normal rank