Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges (Q1715626): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2018.11.002
@@ Property / DOI: 10.1016/j.ejc.2018.11.002 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.04991
@@ Property / arXiv ID: 1805.04991 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of graphs and a random graph with a given degree sequence
+Normal rank
@@ Property / cites work @@
+Asymptotic enumeration of sparse uniform hypergraphs with given degrees
+Normal rank
@@ Property / cites work @@
+Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
+Normal rank
@@ Property / cites work @@
+Perfect Matchings in Random <i>r</i>-regular, <i>s</i>-uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+A reductive approach to hypergraph clustering: an application to image segmentation
+Normal rank
@@ Property / cites work @@
+Approximate counting of regular hypergraphs
@@ Property / cites work: Approximate counting of regular hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic existence of regular combinatorial structures
+Normal rank
@@ Property / cites work @@
+Q3684147
@@ Property / cites work: Q3684147 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraphs of Dense Random Graphs with Specified Degrees
+Normal rank
@@ Property / cites work @@
+Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2018.11.002
@@ Property / DOI: 10.1016/J.EJC.2018.11.002 / rank @@
+Normal rank