39 citations · 146 across the 54 of their papers we have counts for
5 papers · 1 filter
Random independent sets in uncrowded hypergraphs
Abhishek Dhawan, Lina Li, Abhishek Methuku +2
Given any fixed integer and sufficiently large , we show that the largest possible fractional chromatic number of a -uniform -degenerate uncrowded hypergraph …
Counting hypergraphs without linear cycles of fixed length
József Balogh, Ramon I. Garcia, Abhishek Methuku
Let be the -uniform linear cycle on hyperedges. An -graph is -free if it contains no copy of . Let $\operatorname{ex}_{r}(n,C_{k}^…
A nearly linear bound for the Lovász conjecture
Bowen Li, Abhishek Methuku
The celebrated conjecture of Lovász from 1969 asks whether every connected vertex-transitive graph has a Hamiltonian path. Bucić, Christoph, Pokrovskiy and Steiner recently proved…
Long Directed Cycles in Vertex-Transitive Digraphs
Bowen Li, Abhishek Methuku
The search for Hamiltonian cycles in vertex-transitive graphs and digraphs is a classical problem at the interface of graph theory and group theory. In the undirected setting, this…
List coloring uncrowded hypergraphs at the shattering threshold
Abhishek Dhawan, Abhishek Methuku, Minh-Quan Vo
Improving an earlier bound of Frieze and Mubayi, Iliopoulos showed that any -uniform uncrowded hypergraph of maximum degree has list chromatic number at most $(1+o(1))(k-1)\…