vix.ing · top · new · best · stats · spec

Dhawan, Abhishek

  1. Detection of Dense Subhypergraphs by Low-Degree Polynomials
    2023/04/17 by Abhishek Dhawan, Cheng Mao, Dhawan, Abhishek +3 · 5 citations
    Mathematics · #Markov Chains and Monte Carlo Methods #Statistical Methods and Inference #Point processes and geometric inequalities
  2. Coloring graphs with forbidden bipartite subgraphs
    2021/07/12 by James Anderson, Anton Bernshteyn, Anderson, James +3 · 4 citations
    Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
  3. Coloring graphs with forbidden almost bipartite subgraphs
    2022/03/14 by Anderson, James, Bernshteyn, Anton, Dhawan, Abhishek · 3 citations
    #Combinatorics (math.CO) #FOS: Mathematics
  4. The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
    2024/04/05 by Dhawan, Abhishek, Wang, Yuzhou · 3 citations
    #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (stat.ML) #Probability (math.PR)
  5. Coloring locally sparse graphs
    2024/02/29 by James Anderson, Abhishek Dhawan, Anderson, James +3 · 2 citations
    Computer Science · #Graph Labeling and Dimension Problems
  6. Toward Vu's conjecture
    2025/08/22 by Bradshaw, Peter, Dhawan, Abhishek, Methuku, Abhishek +1 · 4 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  7. A linear-time algorithm for (1+ε)Δ-edge-coloring
    2024/07/05 by Anton Bernshteyn, Bernshteyn, Anton, Abhishek Dhawan +1 · 1 citation
    Physics and Astronomy · Decision Sciences · Computer Science · #Color Science and Applications #Scheduling and Timetabling Solutions #Graph Labeling and Dimension Problems
  8. A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
    2024/07/23 by Dhawan, Abhishek · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  9. Bounds for the independence and chromatic numbers of locally sparse graphs
    2024/03/05 by Abhishek Dhawan, Dhawan, Abhishek · 2 citations
    Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Limits and Structures in Graph Theory