Máté Vizer

activity

20142024

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2024

Edge mappings of graphs: Turán type parameters

Yair Caro, Balázs Patkós, Zsolt Tuza +1

In this paper, we address problems related to parameters concerning edge mappings of graphs. The quantity $h (n, G)$ is defined to be the maximum number of edges in an $n$ -vertex gra…

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

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…

math.CO2014

Identifying codes and searching with balls in graphs

Younjin Kim, Mohit Kumbhat, Zoltan Lorant Nagy +3

Given a graph $G$ and a positive integer $R$ we address the following combinatorial search theoretic problem: What is the minimum number of queries of the form "does an unknown ver…