Benjamin Reiniger

According to our database1, Benjamin Reiniger authored at least 14 papers between 2013 and 2022.

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

2022
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt.
Comb., December, 2022

2020
A Simple Characterization of Proportionally 2-choosable Graphs.
Graphs Comb., 2020

2019
Perfect matchings and Hamiltonian cycles in the preferential attachment model.
Random Struct. Algorithms, 2019

Proportional choosability: A new list analogue of equitable coloring.
Discret. Math., 2019

2018
Subhypergraphs in non-uniform random hypergraphs.
Internet Math., 2018

Dynamic coloring parameters for graphs with given genus.
Discret. Appl. Math., 2018

2017
The Game Saturation Number of a Graph.
J. Graph Theory, 2017

The Game of Overprescribed Cops and Robbers Played on Graphs.
Graphs Comb., 2017

The saturation number of induced subposets of the Boolean lattice.
Discret. Math., 2017

2016
Large Subposets with Small Dimension.
Order, 2016

Subgraphs in Non-uniform Random Hypergraphs.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

2015
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges.
Eur. J. Comb., 2015

2014
A note on list-coloring powers of graphs.
Discret. Math., 2014

2013
New Results on Degree Sequences of Uniform Hypergraphs.
Electron. J. Comb., 2013


  Loading...