Dániel T. Soukup

According to our database, Dániel T. Soukup authored at least 12 papers between 2013 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

More ZFC inequalities between cardinal Invariants.

Vera Fischer, Dániel T. Soukup

J. Symb. Log., 2021

A universal partition result for infinite homogeneous Kn-free and related graphs.

Andrés Aranda, Claude Laflamme, Dániel T. Soukup, Robert E. Woodrow

Discret. Math., 2021

Representative & Fair Synthetic Data.

Paul Tiwald, Alexandra Ebert, Dániel T. Soukup

CoRR, 2021

2020

Reducing the dichromatic number via cycle reversions in infinite digraphs.

Paul Ellis, Attila Joó, Dániel T. Soukup

Eur. J. Comb., 2020

2019

Uncountable Strongly Surjective Linear Orders.

Dániel T. Soukup

Order, 2019

Balanced independent sets in graphs omitting large cliques.

Claude Laflamme, Andrés Aranda, Dániel T. Soukup, Robert E. Woodrow

J. Comb. Theory B, 2019

Cycle reversions and dichromatic number in tournaments.

Paul Ellis, Dániel T. Soukup

Eur. J. Comb., 2019

2018

Infinite Combinatorics Plain and Simple.

Dániel T. Soukup, Lajos Soukup

J. Symb. Log., 2018

Orientations of graphs with uncountable chromatic number.

Dániel T. Soukup

J. Graph Theory, 2018

2017

Decompositions of edge-colored infinite complete graphs into monochromatic paths.

Márton Elekes, Dániel T. Soukup, Lajos Soukup, Zoltán Szentmiklóssy

Discret. Math., 2017

2015

Trees, ladders and graphs.

Dániel T. Soukup

J. Comb. Theory B, 2015

2013

Partitioning bases of topological spaces.

Dániel T. Soukup, Lajos Soukup

Electron. Notes Discret. Math., 2013