Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Raphael Steiner

Has grant

ETH Zürich

Switzerland

Research Interests

Explore related searches

Professors in Switzerland

Recent Grants

Grant: Open

Graph coloring motivated by Hadwiger's conjecture

Open Date: 2023-09-01

Close Date: 2027-08-31

Articles (28)

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Collaborators (3)

Nemanja Draganić

University of Oxford

UNITED KINGDOM

View details

Carla Groenland

Delft University of Technology

NETHERLANDS

View details

Jérémie Turcotte

McGill University

CANADA

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Raphael Steiner

Research Interests

Explore related searches

Recent Grants

Articles (28)

Chromatic number and regular subgraphs

Size‐Ramsey Numbers of Structurally Sparse Graphs

Complexity of polytope diameters via perfect matchings

Twin-width of sparse random graphs

Longest cycles in vertex-transitive and highly connected graphs

A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs

Shortest paths on polymatroids and hypergraphic polytopes

Fractional chromatic number vs. Hall ratio

A note on digraph splitting

Improved bounds for zero-sum cycles in Zpd

Optimal bounds for zero-sum cycles. I. Odd order

Inapproximability of shortest paths on perfect matching polytopes

Resolution of the Kohayakawa–Kreuter conjecture

Vertex-critical graphs far from edge-criticality

Clustered Colouring of Odd-H-Minor-Free Graphs

Geometric Realizations of Dichotomous Ordinal Graphs

Random independent sets in triangle-free graphs

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs

Finding dense minors using average degree

Subdivisions with congruence constraints in digraphs of large chromatic number

Subdigraphs of prescribed size and out‐degree

On coloring digraphs with forbidden induced subgraphs

Cycle lengths modulo k in expanders

Improved bound for improper colourings of graphs with no odd clique minor

Matching theory and Barnette's conjecture

Odd Hadwiger for line-graphs

Complete directed minors and chromatic number

Heroes in Orientations of Chordal Graphs

Collaborators (3)

Nemanja Draganić

Carla Groenland

Jérémie Turcotte

Make your next move.