The following pages link to Máté Vizer (Q322259):
Displaying 50 items.
- Finding a majority ball with majority answers (Q322261) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- Regular graphs are antimagic (Q888592) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- (Q1688852) (redirect page) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Majority problems of large query size (Q1720318) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Smart elements in combinatorial group testing problems (Q1752611) (← links)
- Forbidden subposet problems for traces of set families (Q1784275) (← links)
- On the ratio of maximum and minimum degree in maximal intersecting families (Q1928459) (← links)
- The biased odd cycle game (Q1953485) (← links)
- The variety of domination games (Q2007624) (← links)
- Forbidden subposet problems in the grid (Q2065899) (← links)
- Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
- Rainbow Ramsey problems for the Boolean lattice (Q2088071) (← links)
- Fuglede's conjecture holds for cyclic groups of order \(pqrs\) (Q2090577) (← links)
- A plurality problem with three colors and query size three (Q2092374) (← links)
- On saturation of Berge hypergraphs (Q2122672) (← links)
- Saturation problems with regularity constraints (Q2142663) (← links)
- Singular Turán numbers and worm-colorings (Q2158187) (← links)
- On the discrete Fuglede and Pompeiu problems (Q2174117) (← links)
- Edge-ordered Ramsey numbers (Q2178669) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- On Grundy total domination number in product graphs (Q2214319) (← links)
- Game saturation of intersecting families (Q2248514) (← 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)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- Generalized Turán problems for disjoint copies of graphs (Q2324501) (← links)
- Geometry of permutation limits (Q2338620) (← links)
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets (Q2346594) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
- Stability results for vertex Turán problems in Kneser graphs (Q2415074) (← links)
- A note on tilted Sperner families with patterns (Q2629285) (← links)
- Supersaturation, counting, and randomness in forbidden subposet problems (Q2656893) (← links)
- Vertex Turán problems for the oriented hypercube (Q2667743) (← links)
- Turán problems for edge-ordered graphs (Q2692781) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- Coloring Points with Respect to Squares (Q3132836) (← links)
- On the size of planarly connected crossing graphs (Q4600734) (← links)
- Correlation Bounds for Distant Parts of Factor of IID Processes (Q4601049) (← links)
