BROWSE

Related Scientist

chakraborti,debsoumya's photo.

chakraborti,debsoumya
이산수학그룹
more info

ITEM VIEW & DOWNLOAD

Extremal bipartite independence number and balanced coloring

Cited 0 time in webofscience Cited 0 time in scopus
387 Viewed 0 Downloaded
Title
Extremal bipartite independence number and balanced coloring
Author(s)
Debsoumya Chakraborti
Publication Date
2023-10
Journal
European Journal of Combinatorics, v.113
Publisher
Academic Press
Abstract
In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree D and with n vertices on each side has a balanced independent set containing (1−ϵ)[Formula presented]n vertices from each side for small ϵ>0. Secondly, we prove that the vertex set of every sufficiently large balanced bipartite graph with maximum degree at most Δ can be partitioned into (1+ϵ)[Formula presented] balanced independent sets. Both of these results are algorithmic and best possible up to a factor of 2, which might be hard to improve as evidenced by the phenomenon known as ‘algorithmic barrier’ in the literature. The first result improves a recent theorem of Axenovich, Sereni, Snyder, and Weber in a slightly more general setting. The second result improves a theorem of Feige and Kogan about coloring balanced bipartite graphs. © 2023 Elsevier Ltd
URI
https://pr.ibs.re.kr/handle/8788114/13614
DOI
10.1016/j.ejc.2023.103750
ISSN
0195-6698
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse