Dániel Gerbner

,

Graphs Comb., February, 2026

Uniquely C 4 + -saturated graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2026

On forbidding graphs as traces of hypergraphs.

[BibT_eX]

[DOI]

,

Michael E. Picollelli

Discret. Math., 2026

On Turán problems for suspension hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2026

On Turán-Type Problems and the Abstract Chromatic Number.

[BibT_eX]

[DOI]

,

Hilal Hama Karim

,

Gaurav Kucheriya

Electron. J. Comb., 2026

A note on strongly and totally chain intersecting families.

[BibT_eX]

[DOI]

Graphs Comb., December, 2025

Finding the diameter of a tree with distance queries.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, September, 2025

Cooperation in combinatorial search.

[BibT_eX]

[DOI]

,

,

,

,

Optim. Lett., March, 2025

On hypergraph Turán problems with bounded matching number.

[BibT_eX]

[DOI]

,

Casey Tompkins

,

Junpeng Zhou

Eur. J. Comb., 2025

On degree powers and counting stars in F-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

On non-degenerate Turán problems for expansions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Degree powers and number of stars in graphs with a forbidden broom.

[BibT_eX]

[DOI]

Discret. Math., 2025

Query complexity of Boolean functions on the middle slice of the cube.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Appl. Math., 2025

On the number of A-transversals in hypergraphs.

[BibT_eX]

[DOI]

János Barát

,

,

Anastasia Halfpap

Period. Math. Hung., September, 2024

On Non-degenerate Berge-Turán Problems.

[BibT_eX]

[DOI]

Graphs Comb., April, 2024

Some exact results for regular Turán problems for all large orders.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., March, 2024

Generalized Turán results for intersecting cliques.

[BibT_eX]

[DOI]

,

Discret. Math., January, 2024

The Turán Number of Berge Book Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Stability from graph symmetrization arguments in generalized Turán problems.

[BibT_eX]

[DOI]

,

Hilal Hama Karim

J. Graph Theory, 2024

On Turán problems with bounded matching number.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Stability of extremal connected hypergraphs avoiding Berge-paths.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 2024

On weakly Turán-good graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2024

Generalized Turán results for disjoint cliques.

[BibT_eX]

[DOI]

Discret. Math., 2024

On the extremal graphs in generalized Turán problems.

[BibT_eX]

[DOI]

Discret. Math., 2024

Directed Graphs Without Rainbow Stars.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2024

The Profile Polytope of Nontrivial Intersecting Families.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

The maximum number of triangles in Fk-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., December, 2023

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Discret. Appl. Math., December, 2023

Generalized Turán problems for double stars.

[BibT_eX]

[DOI]

Discret. Math., July, 2023

Paths are Turán-good.

[BibT_eX]

[DOI]

Graphs Comb., June, 2023

Turán problems for edge-ordered graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory B, May, 2023

Generalized Turán problems for small graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

A plurality problem with three colors and query size three.

[BibT_eX]

[DOI]

,

Dániel Lenger

,

Discret. Math., 2023

Some Exact Results for Non-Degenerate Generalized Turán Problems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Generalized Turán problems for $K_{2,t}$.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

The covering lemma and q-analogues of extremal set theory problems.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2023

Rainbow Ramsey Problems for the Boolean Lattice.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Order, October, 2022

Generalized Turán Problems for Complete Bipartite Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2022

Hypergraph Based Berge Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2022

On saturation of Berge hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2022

Some exact results for generalized Turán problems.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2022

A note on the uniformity threshold for Berge hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Singular Turán numbers and WORM-colorings.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2022

Saturation problems with regularity constraints.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

Unified approach to the generalized Turán problem and supersaturation.

[BibT_eX]

[DOI]

,

Zoltán Lóránt Nagy

,

Discret. Math., 2022

Forbidden subposet problems in the grid.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

Generalized Rainbow Turán Numbers.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2022

On the maximum number of copies of H in graphs with given size and order.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2021

Hypergraphs without exponents.

[BibT_eX]

[DOI]

Zoltán Füredi

,

J. Comb. Theory A, 2021

A Note on Stability for Maximal F-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

On non-adaptive majority problems of large query size.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2021

On Turán-good graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

Adaptive majority problems for restricted query graphs and for weighted sets.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

,

,

Discret. Appl. Math., 2021

Supersaturation, Counting, and Randomness in Forbidden Subposet Problems.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2021

A note on the Turán number of a Berge odd cycle.

[BibT_eX]

[DOI]

Australas. J Comb., 2021

t-Wise Berge and t-Heavy Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2020

Ramsey Problems for Berge Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2020

Generalized Forbidden Subposet Problems.

[BibT_eX]

[DOI]

,

Balázs Keszegh

,

Order, 2020

Generalized Turán problems for even cycles.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2020

General lemmas for Berge-Turán hypergraph problems.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2020

Set systems related to a house allocation problem.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Math., 2020

Rounds in a combinatorial search problem.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2020

On clique coverings of complete multipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2020

Finding non-minority balls with majority and plurality queries.

[BibT_eX]

[DOI]

Huilan Chang

,

,

Discret. Appl. Math., 2020

On Berge-Ramsey Problems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Smart elements in combinatorial group testing problems with more defectives.

[BibT_eX]

[DOI]

,

Art Discret. Appl. Math., 2020

Forbidding Rank-Preserving Copies of a Poset.

[BibT_eX]

[DOI]

,

,

,

,

Order, 2019

An improvement on the maximum number of k?dominating independent sets.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2019

Asymptotics for the Turán number of Berge-K2, t.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2019

On the Number of Containments in P-free Families.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2019

Counting copies of a fixed subgraph in F-free graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2019

Linearity of saturation for Berge hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2019

Generalized Turán problems for disjoint copies of graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2019

Majority problems of large query size.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2019

Between the deterministic and non-deterministic query complexity.

[BibT_eX]

[DOI]

CoRR, 2019

Stability Results for Vertex Turán Problems in Kneser Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2019

On the Weight of Berge-F-Free Hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2019

On the Number of Cycles in a Graph with Restricted Cycle Lengths.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2018

Line Percolation in Finite Projective Planes.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2018

Smart elements in combinatorial group testing problems.

[BibT_eX]

[DOI]

,

J. Comb. Optim., 2018

Identifying defective sets using queries of small size.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2018

Forbidden Subposet Problems for Traces of Set Families.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2018

Extremal Results for Berge Hypergraphs.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2017

Intersecting P-free families.

[BibT_eX]

[DOI]

,

,

Casey Tompkins

J. Comb. Theory A, 2017

Finding a non-minority ball with majority answers.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2017

Conscious and controlling elements in combinatorial group testing problems with more defectives.

[BibT_eX]

[DOI]

,

CoRR, 2017

Conscious and controlling elements in combinatorial group testing problems.

[BibT_eX]

[DOI]

,

CoRR, 2017

Search for the end of a path in the d-dimensional grid and in other graphs.

[BibT_eX]

[DOI]

,

,

,

,

Ars Math. Contemp., 2017

Topological orderings of weighted directed acyclic graphs.

[BibT_eX]

[DOI]

,

,

,

Inf. Process. Lett., 2016

A note on tilted Sperner families with patterns.

[BibT_eX]

[DOI]

,

Discret. Math., 2016

Finding a majority ball with majority answers.

[BibT_eX]

[DOI]

,

,

,

,

,

Electron. Notes Discret. Math., 2015

A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.

[BibT_eX]

[DOI]

Zoltán Füredi

,

,

Eur. J. Comb., 2015

Advantage in the discrete Voronoi game.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Algorithms Appl., 2014

Covering Paths for Planar Point Sets.

[BibT_eX]

[DOI]

,

,

,

Discret. Comput. Geom., 2014

Edge-decomposition of Graphs into Copies of a Tree with Four Edges.

[BibT_eX]

[DOI]

János Barát

,

Electron. J. Comb., 2014

Partitioning 2-edge-colored graphs by monochromatic paths and cycles.

[BibT_eX]

[DOI]

,

,

,

,

Comb., 2014

Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.

[BibT_eX]

[DOI]

,

,

,

,

,

Graphs Comb., 2013

Saturating Sperner Families.

[BibT_eX]

[DOI]

,

,

,

,

,

Graphs Comb., 2013

The Magnus-Derek game in groups.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Majority and plurality problems.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2013

Separating families of convex sets.

[BibT_eX]

[DOI]

,

Géza Tóth

Comput. Geom., 2013

Profile polytopes of some classes of families.

[BibT_eX]

[DOI]

Comb., 2013

Almost Intersecting Families of Sets.

[BibT_eX]

[DOI]

,

,

,

,

SIAM J. Discret. Math., 2012

Generalizations of the tree packing conjecture.

[BibT_eX]

[DOI]

,

Balázs Keszegh

,

Discuss. Math. Graph Theory, 2012

Search for the end of a path in the d-dimensional grid and in other graphs

[BibT_eX]

[DOI]

,

,

,

CoRR, 2012

Two-Part Set Systems.

[BibT_eX]

[DOI]

,

,

,

,

,

Electron. J. Comb., 2012

Path-search in the pyramid and in other graphs

[BibT_eX]

[DOI]

,

Balázs Keszegh

CoRR, 2011

Polychromatic colorings of arbitrary rectangular partitions.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2010

Finding the maximum and minimum elements with one lie.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2010

Profile vectors in the lattice of subspaces.

[BibT_eX]

[DOI]

,

Discret. Math., 2009

l-Chain Profile Vectors.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2008

Chain Intersecting Families.

[BibT_eX]

[DOI]

Attila Bernáth

,