Máté Vizer

activity

20112025

most citedOn the discrete Fuglede and Pompeiu problems

22 citations · 99 across the 48 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

The robust chromatic number of certain graph classes

Gábor Bacsó, Csilla Bujtás, Balázs Patkós +2

A 1-selection $f$ of a graph $G$ is a function $f : V (G) \to E (G)$ such that $f (v)$ is incident to $v$ for every vertex $v$ . The 1-removed $G_{f}$ is the graph $(V(G),E(G)\setm…

math.CO2023

The robust chromatic number of graphs

Gábor Bacsó, Balázs Patkós, Zsolt Tuza +1

A 1-removed subgraph $G_{f}$ of a graph $G = (V, E)$ is obtained by $(i)$ selecting at most one edge $f (v)$ for each vertex $v \in V$ , such that $v \in f (v) \in E$ (the mapping $f:V\to E \…

math.CO2023

Extremal graph theoretic questions for q-ary vectors

Balázs Patkós, Zsolt Tuza, Máté Vizer

A $q$ -graph $H$ on $n$ vertices is a set of vectors of length $n$ with all entries from ${0, 1, \dots, q}$ and every vector (that we call a $q$ -edge) having exactly two non-zero ent…

math.CO2023

Vector sum-intersection theorems

Balázs Patkós, Zsolt Tuza, Máté Vizer

We introduce the following generalization of set intersection via characteristic vectors: for $n, q, s, t \geq 1$ a family $F \subseteq {0, 1, \dots, q}^{n}$ of vectors is said…