The following pages link to Máté Vizer (Q322259):
Displaying 25 items.
- Line Percolation in Finite Projective Planes (Q4637326) (← links)
- On non-adaptive majority problems of large query size (Q5024678) (← links)
- On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs (Q5028353) (← links)
- Smart elements in combinatorial group testing problems with more defectives (Q5121559) (← links)
- $t$-Wise Berge and $t$-Heavy Hypergraphs (Q5128511) (← links)
- Ramsey Problems for Berge Hypergraphs (Q5215899) (← links)
- An improvement on the maximum number of ‐dominating independent sets (Q5379840) (← links)
- An analogue of the Erdős-Ko-Rado theorem for multisets (Q5419935) (← links)
- On the maximum number of copies of H in graphs with given size and order (Q6055379) (← links)
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164) (← links)
- Improved lower bounds for multiplicative square-free sequences (Q6117250) (← links)
- Vector sum-intersection theorems (Q6172276) (← links)
- Some exact results for regular Turán problems for all large orders (Q6181995) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6201910) (← links)
- Forbidden subposet problems for traces of set families (Q6287472) (← links)
- On the discrete Fuglede and Pompeiu problems (Q6303970) (← links)
- Rainbow Ramsey problems for the Boolean lattice (Q6307138) (← links)
- Tur\'an problems for Edge-ordered graphs (Q6332248) (← links)
- Fuglede's conjecture holds for cyclic groups of order $pqrs$ (Q6354069) (← links)
- The Constructor-Blocker Game (Q6394885) (← links)
- Counting Connected Partitions of Graphs (Q6414516) (← links)
- On ordered Ramsey numbers of tripartite 3-uniform hypergraphs (Q6416770) (← links)
- Extremal graph theoretic questions for q-ary vectors (Q6435135) (← links)
- The robust chromatic number of graphs (Q6435136) (← links)
- The robust chromatic number of certain graph classes (Q6435138) (← links)