researcher

Ross J. Kang

49 papers hereh-index 17950 citations79 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author1
first author9
middle author20
last author18

Across the 48 of 49 papers where every author was matched, so the position is known.

fields

math.CO46
math.PR2
cs.DS1

same name

Ross J. Kang — 6 papers, h 2
Ross J. Kang — 3 papers, h 2
Ross J. Kang — 2 papers, h 2
Ross J. Kang — 1 paper
Ross J. Kang — 1 paper, h 1
Ross J. Kang — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20082026

most citedOn r-dynamic Coloring of Grids

37 citations · 312 across the 39 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017★ 1 cited

The Bollobás-Eldridge-Catlin conjecture for even girth at least $10$

Wouter Cames van Batenburg, Ross J. Kang

Two graphs $G_{1}$ and $G_{2}$ on $n$ vertices are said to \textit{pack} if there exist injective mappings of their vertex sets into $[n]$ such that the images of their edge sets are d…

math.CO2017★ 8 cited

Distance colouring without one cycle length

Ross J. Kang, François Pirot

We consider distance colourings in graphs of maximum degree at most $d$ and how excluding one fixed cycle length $ℓ$ affects the number of colours required as $d \to \infty$ . For…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

The Bollobás-Eldridge-Catlin conjecture for even girth at least 10

Distance colouring without one cycle length

The Bollobás-Eldridge-Catlin conjecture for even girth at least $10$