Minimum clique-free subgraphs of Kneser graphs (Q2243816): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Problem in Graph Theory
@@ Property / cites work: A Problem in Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558932
@@ Property / cites work: Q5558932 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133994
@@ Property / cites work: Q4133994 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
+Normal rank
@@ Property / cites work @@
+\(K_{s,t}\)-saturated bipartite graphs
@@ Property / cites work: \(K_{s,t}\)-saturated bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact bounds for some hypergraph saturation problems
+Normal rank
@@ Property / cites work @@
+Saturation in random graphs
@@ Property / cites work: Saturation in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Star saturation number of random graphs
@@ Property / cites work: Star saturation number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weak saturation numbers of complete bipartite graphs in the clique
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064562420060204
+Normal rank
@@ Property / OpenAlex ID @@
+W3135888076
@@ Property / OpenAlex ID: W3135888076 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2243816