Zsolt Adam Wagner

Orcid: 0000-0002-6423-3730

According to our database1, Zsolt Adam Wagner authored at least 21 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Intersecting families of sets are typically trivial.
J. Comb. Theory, Ser. B, January, 2024

2023
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search.
CoRR, 2023

Balanced Edge-Colorings Avoiding Rainbow Cliques of Size Four.
Electron. J. Comb., 2023

2022
Uniform chain decompositions and applications.
Random Struct. Algorithms, 2022

Infinite Sperner's theorem.
J. Comb. Theory, Ser. A, 2022

2021
Constructions in combinatorics via neural networks.
CoRR, 2021

2020
Families in posets minimizing the number of comparable pairs.
J. Graph Theory, 2020

Completion and deficiency problems.
J. Comb. Theory, Ser. B, 2020

Refuting conjectures in extremal combinatorics via linear programming.
J. Comb. Theory, Ser. A, 2020

Bounded Degree Spanners of the Hypercube.
Electron. J. Comb., 2020

The Ramsey Number of Fano Plane Versus Tight Path.
Electron. J. Comb., 2020

2019
Partition problems in high dimensional boxes.
J. Comb. Theory, Ser. A, 2019

The largest projective cube-free subsets of Z2n.
Eur. J. Comb., 2019

Turán numbers for Berge-hypergraphs and related extremal problems.
Discret. Math., 2019

Tilings in Randomly Perturbed Dense Graphs.
Comb. Probab. Comput., 2019

Monochromatic Hilbert Cubes and Arithmetic Progressions.
Electron. J. Comb., 2019

2018
Two results about the hypercube.
Discret. Appl. Math., 2018

2017
Large Subgraphs in Rainbow-Triangle Free Colorings.
J. Graph Theory, 2017

2016
Applications of graph containers in the Boolean lattice.
Random Struct. Algorithms, 2016

2015
Cops and Robbers on diameter two graphs.
Discret. Math., 2015

2013
An improved bound on the cop number of graphs of small diameter.
CoRR, 2013


  Loading...