5 papers
Edges of the uniform random forest of are pairwise negatively correlated for every
Anish Gupta
Let be uniform on all forests of the simple complete graph , with isolated vertices allowed. A conjecture of Kahn and of Winkler, studied by Grimmett and Winkler, assert…
A rate for the average vacancy of uniformly random matchings in linear hypergraphs
Anish Gupta
Let be chosen uniformly from all matchings of a finite linear -uniform hypergraph , and let be the average probability that a vertex is left uncovered.…
Pairwise edge correlations in random minimum spanning trees: a universal bound and complete-graph negative correlation
Anish Gupta
Let be a finite connected multigraph whose edges receive independent weights from one atomless law, and let be the resulting random minimum spanning tre…
Tuza's conjecture for graphs of maximum degree at most seven
Anish Gupta
Tuza conjectured that every finite simple graph satisfies , where is the maximum number of pairwise edge-disjoint triangles and is the minimum nu…
Balance Constants, Majority Cycles, and the Gold Partition Conjecture through Fourteen Elements
Anish Gupta
We determine the exact extremal balance data of all 1,338,193,159,771 unlabeled posets on fourteen elements. The least balance constant exceeding is . The least over…