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

Bjarne Schülke

Germany

Research Interests

Explore related searches

Professors in Germany

Articles (12)

Year:

2026

Year:

2026

Year:

2023

Year:

2023

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Year:

2020

Collaborators (3)

Joonkyung Lee

Yonsei University

SOUTH KOREA

View details

Mathias Schacht

Professor

Universität Hamburg

GERMANY

View details

Simón Piga

University of Birmingham

UNITED KINGDOM

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Bjarne Schülke

Research Interests

Explore related searches

Articles (12)

Beyond the broken tetrahedron

Separating hypergraph Turán densities

A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs

Decomposing hypergraphs into cycle factors

On extremal problems concerning the traces of sets

Maximum size of r-cross t-intersecting families

On Hamiltonian cycles in hypergraphs with dense link graphs

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k

Convex graphon parameters and graph norms

Covering 3-Edge-Colored Random Graphs with Monochromatic Trees

Embedding spanning subgraphs in uniformly dense and inseparable graphs

Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs

Collaborators (3)

Joonkyung Lee

Mathias Schacht

Simón Piga

Make your next move.

Bjarne Schülke

Research Interests

Explore related searches

Articles (12)

Beyond the broken tetrahedron

Separating hypergraph Turán densities

A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs

Decomposing hypergraphs into cycle factors

On extremal problems concerning the traces of sets

Maximum size of r-cross t-intersecting families

On Hamiltonian cycles in hypergraphs with dense link graphs

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k

Convex graphon parameters and graph norms

Covering 3-Edge-Colored Random Graphs with Monochromatic Trees

Embedding spanning subgraphs in uniformly dense and inseparable graphs

Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs

Collaborators (3)

Joonkyung Lee

Mathias Schacht

Simón Piga

Make your next move.

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k