The following pages link to Dániel Gerbner (Q284343):
Displaying 50 items.
- Topological orderings of weighted directed acyclic graphs (Q284347) (← links)
- Finding a majority ball with majority answers (Q322261) (← links)
- Separating families of convex sets (Q364852) (← links)
- Saturating Sperner families (Q367051) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- Two-part set systems (Q426823) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- Finding the maximum and minimum elements with one lie (Q708325) (← links)
- Finding non-minority balls with majority and plurality queries (Q777450) (← links)
- Generalized forbidden subposet problems (Q781542) (← links)
- Profile vectors in the lattice of subspaces (Q1043640) (← links)
- Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
- Majority problems of large query size (Q1720318) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- Forbidden subposet problems for traces of set families (Q1784275) (← links)
- Majority and plurality problems (Q1946224) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- On Turán-good graphs (Q2032868) (← links)
- Hypergraphs without exponents (Q2049452) (← links)
- A note on stability for maximal \(F\)-free graphs (Q2053718) (← links)
- Hypergraph based Berge hypergraphs (Q2062896) (← links)
- Forbidden subposet problems in the grid (Q2065899) (← links)
- Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
- Generalized Turán problems for complete bipartite graphs (Q2084784) (← links)
- Rainbow Ramsey problems for the Boolean lattice (Q2088071) (← links)
- A plurality problem with three colors and query size three (Q2092374) (← links)
- On saturation of Berge hypergraphs (Q2122672) (← links)
- Some exact results for generalized Turán problems (Q2136200) (← links)
- Saturation problems with regularity constraints (Q2142663) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- A note on the uniformity threshold for Berge hypergraphs (Q2145761) (← links)
- Singular Turán numbers and worm-colorings (Q2158187) (← links)
- 3-uniform hypergraphs without a cycle of length five (Q2182003) (← links)
- Set systems related to a house allocation problem (Q2182206) (← links)
- On Berge-Ramsey problems (Q2185230) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- Forbidding rank-preserving copies of a poset (Q2279687) (← links)
- On the number of containments in \(P\)-free families (Q2287744) (← links)
- On clique coverings of complete multipartite graphs (Q2309546) (← links)
- Rounds in a combinatorial search problem (Q2309553) (← links)
- The Turań number of \(2P_7\) (Q2312054) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- Path search in the pyramid and in other graphs (Q2320763) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- Generalized Turán problems for disjoint copies of graphs (Q2324501) (← links)
- On the weight of Berge-\(F\)-free hypergraphs (Q2327220) (← links)
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets (Q2346594) (← links)
