Polynomial-time perfect matchings in dense hypergraphs (Q475264): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C65
@@ Property / Mathematics Subject Classification ID: 05C65 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C42
@@ Property / Mathematics Subject Classification ID: 05C42 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6374148
@@ Property / zbMATH DE Number: 6374148 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hypergraphs
@@ Property / zbMATH Keywords: hypergraphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithms
@@ Property / zbMATH Keywords: algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+matchings
@@ Property / zbMATH Keywords: matchings / rank @@
+Normal rank

Revision as of 17:43, 30 June 2023