Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Nagy, Zolt��n L��r��nt"'
An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the other one. It has been shown that apart from finitely many counterexa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a506faa853260515ac4556911289637
http://arxiv.org/abs/2109.14421
http://arxiv.org/abs/2109.14421
We prove an asymptotic result on the maximum number of k-vertex subtrees in binary trees of given order. This problem turns out to be equivalent to determine the maximum number of k+2-cycles in n-vertex outerplanar graphs, thus we settle the generali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c204c40f4256885166e670f90b38abf6
We consider a natural generalisation of Tur��n's forbidden subgraph problem and the Ruzsa-Szemer��di problem by studying the maximum number $ex_F(n,G)$ of edge-disjoint copies of a fixed graph $F$ can be placed on an $n$-vertex ground set wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57e097462797841a01e59e857bb64262
In this paper we introduce a unifying approach to the generalized Tur��n problem and supersaturation results in graph theory. The supersaturation-extremal function $satex(n, F : m, G)$ is the least number of copies of a subgraph $G$ an $n$-vertex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9290e0d842b08c5ece27371fa88b5f1
The $r$-blowup of a graph $F$, denoted by $F[r]$, is the graph obtained by replacing the vertices and edges of $F$ with independent sets of size $r$ and copies of $K_{r,r}$, respectively. For bipartite graphs $F$, very little is known about the order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ad5f792661a42f6c9440a15a1529f69
Autor:
Janzer, Oliver, Nagy, Zolt��n L��r��nt
The long-standing Erd��s-Faber-Lov��sz conjecture states that every $n$-uniform linear hypergaph with $n$ edges has a proper vertex-coloring using $n$ colors. In this paper we propose an algebraic framework to the problem and formulate a corr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9510e2ff2551500bf3e3886e66e70b07
A conjecture of Erd��s from 1967 asserts that any graph on $n$ vertices which does not contain a fixed $r$-degenerate bipartite graph $F$ has at most $Cn^{2-1/r}$ edges, where $C$ is a constant depending only on $F$. We show that this bound holds
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::add47691f10dce4b33393f835c525bff
Autor:
Nagy, Zolt��n L��r��nt
For a positive integer $n$, a graph $F$ and a bipartite graph $G\subseteq K_{n,n}$ let ${F(n+n, G)}$ denote the number of copies of $F$ in $G$, and let $F(n+n, m)$ denote the minimum number of copies of $F$ in all graphs $G\subseteq K_{n,n}$ with $m$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c55d564082ccc72a91be17eb50803564
Autor:
H��ger, Tam��s, Nagy, Zolt��n L��r��nt
Publikováno v:
J COMB DES JOURNAL OF COMBINATORIAL DESIGNS.
We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a dominating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ddab9a03073badc3b2e0abd9b8cae78
http://hdl.handle.net/10831/48894
http://hdl.handle.net/10831/48894
Autor:
Bar��t, J��nos, Nagy, Zolt��n L��r��nt
We are seeking a sufficient condition that forces a transversal in a generalized Latin square. A generalized Latin square of order $n$ is equivalent to a proper edge-coloring of $K_{n,n}$. A transversal corresponds to a multicolored perfect matching.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03fa095dc6ebb5b8de88e40ec21d4087