Abhishek Dhawan’s research while affiliated with Georgia Institute of Technology and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (1)


Balanced Independent Sets and Colorings of Hypergraphs
  • Article
  • Full-text available

January 2025

·

1 Read

·

2 Citations

Abhishek Dhawan

A k k ‐uniform hypergraph H = ( V , E ) H = ( V , E ) is k k ‐partite if V V can be partitioned into k k sets V 1 , … , V k V 1 , \unicode{x02026} , V k such that every edge in E E contains precisely one vertex from each V i V i . We call such a graph n n ‐balanced if ∣ V i ∣ = n \unicode{x02223} V i \unicode{x02223} = n for each i i . An independent set I I in H H is balanced if ∣ I ∩ V i ∣ = ∣ I ∩ V j ∣ \unicode{x02223} I \unicode{x02229} V i \unicode{x02223} = \unicode{x02223} I \unicode{x02229} V j \unicode{x02223} for each 1 ⩽ i , j ⩽ k 1 \unicode{x02A7D} i , j \unicode{x02A7D} k , and a coloring is balanced if each color class induces a balanced independent set in H H . In this paper, we provide a lower bound on the balanced independence number α b ( H ) \unicode{x003B1} b ( H ) in terms of the average degree D = ∣ E ∣ / n D = \unicode{x02223} E \unicode{x02223} / n , and an upper bound on the balanced chromatic number χ b ( H ) \unicode{x003C7} b ( H ) in terms of the maximum degree Δ \unicode{x00394} . Our results recover those of recent work of Chakraborti for k = 2 k = 2 .

Download

Citations (1)


... However, we note that this property does not extend to k-partite k-graphs for k 3. In fact, such graphs need not be triangle-free, which makes it all the more surprising that our result matches that of Theorem 2. Furthermore, as noted in earlier work of the author [14], the approach toward proving results on k-partite k-graphs is similar to those employed in other problems related to bipartite graphs. It would be worth investigating when combinatorial results on bipartite graphs extend to the k-partite setting. ...

Reference:

List Colorings of $k$-Partite $k$-Graphs
Balanced Independent Sets and Colorings of Hypergraphs