The following pages link to Ross J. Kang (Q324378):
Displaying 50 items.
- On a Ramsey-type problem of Erdős and Pach (Q324379) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- Invasion percolation on the Poisson-weighted infinite tree (Q433897) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Dot product representations of planar graphs (Q648410) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- Distance edge-colourings and matchings (Q714033) (← links)
- Arrangements of pseudocircles and circles (Q741610) (← links)
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- The \(t\)-stability number of a random graph (Q976708) (← links)
- Discrepancy and large dense monochromatic subsets (Q1630686) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Packing two graphs of even girth 10 (Q1689911) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- Bounded monochromatic components for random graphs (Q1750660) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- List injective edge-coloring of subcubic graphs (Q2043370) (← links)
- Mathematical (online) meetings reimagined? (Q2076020) (← links)
- Bipartite induced density in triangle-free graphs (Q2185224) (← links)
- Approximate strong edge-colouring of unit disk graphs (Q2193090) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- VC dimension and a union theorem for set systems (Q2315444) (← links)
- On \(r\)-dynamic coloring of grids (Q2345621) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Largest sparse subgraphs of random graphs (Q2509750) (← links)
- Colouring random graphs (Q2822597) (← links)
- Coloring powers and girth (Q2827489) (← links)
- The latest designs (Q2831698) (← links)
- On distance edge-colourings and matchings (Q2851479) (← links)
- Largest sparse subgraphs of random graphs (Q2857370) (← links)
- For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (Q2930050) (← links)
- A Precise Threshold for Quasi-Ramsey Numbers (Q2947436) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- Dot Product Representations of Planar Graphs (Q3073680) (← links)
- Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring (Q3094926) (← links)
- Squared Chromatic Number Without Claws or Large Cliques (Q3121310) (← links)
- Tight inequalities among set hitting times in Markov chains (Q3190216) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- The t-improper chromatic number of random graphs (Q3503499) (← links)
- The <i>t</i>-Improper Chromatic Number of Random Graphs (Q3557526) (← links)
- (Q3576687) (← links)
- Induced Matchings in Subcubic Planar Graphs (Q3586388) (← links)
- Circular choosability (Q3652533) (← links)
- On a Ramsey-type problem of Erdős and Pach (Q4601481) (← links)
