Christian Reiher

Orcid: 0000-0002-1793-3865

According to our database1, Christian Reiher authored at least 26 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Note on the Theorem of Balog, Szemerédi, and Gowers.
Comb., June, 2024

2023
Two disjoint cycles in digraphs.
J. Graph Theory, November, 2023

Sandwiching biregular random graphs.
Comb. Probab. Comput., January, 2023

The feasible region of induced graphs.
J. Comb. Theory B, 2023

A unified approach to hypergraph stability.
J. Comb. Theory B, 2023

2022
On the Ramsey-Turán Density of Triangles.
Comb., 2022

2021
Andrásfai and Vega graphs in Ramsey-Turán theory.
J. Graph Theory, 2021

High powers of Hamiltonian cycles in randomly augmented graphs.
J. Graph Theory, 2021

On Hamiltonian cycles in hypergraphs with dense link graphs.
J. Comb. Theory B, 2021

Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Embedding spanning subgraphs in uniformly dense and inseparable graphs.
Random Struct. Algorithms, 2020

Powers of Hamiltonian cycles in randomly augmented graphs.
Random Struct. Algorithms, 2020

Squares of Hamiltonian cycles in 3-uniform hypergraphs.
Random Struct. Algorithms, 2020

Extremal problems in uniformly dense hypergraphs.
Eur. J. Comb., 2020

2019
On the local density problem for graphs of given odd-girth.
J. Graph Theory, 2019

The Colouring Number of Infinite Graphs.
Comb., 2019

Turán's Theorem for the Fano Plane.
Comb., 2019

2018
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs.
J. Lond. Math. Soc., 2018

A tale of stars and cliques.
J. Comb. Theory A, 2018

A Ramsey class for Steiner systems.
J. Comb. Theory A, 2018

2017
The chromatic number of finite type-graphs.
J. Comb. Theory B, 2017

2016
Embedding tetrahedra into quasirandom hypergraphs.
J. Comb. Theory B, 2016

Minimizing the regularity of maximal regular antichains of 2- and 3-sets.
Australas. J Comb., 2016

2014
Counting odd cycles in locally dense graphs.
J. Comb. Theory B, 2014

2013
Formal duality and generalizations of the Poisson summation formula.
Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013

2009
Relaxation procedures on graphs.
Discret. Appl. Math., 2009


  Loading...