Oscar Zamora
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Oscar Zamora has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Ervin Győri
HUN-REN Alfréd Rényi Institute of Mathematics 1053 Budapest Hungary
10 shared publications - Addisu Paulos
Central European University, Budapest, Hungary
6 shared publications - Casey Tompkins
ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS BUDAPEST HUNGARY
6 shared publications - Nika Salia
King Fahd University of Petroleum and Minerals
6 shared publications - Chuanqi Xiao
Central European University Budapest
4 shared publications - Debarun Ghosh
Central European University Budapest
3 shared publications
Latest Publications
- 24 July 2024
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (2) , 89-115
Planar Turán Number of the Θ6
Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.Let Θ
- 24 July 2024
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (2) , 89-115
Planar Turán Number of the Θ6
Let F be a nonempty family of graphs. A graph 𝐺 is called F -free if it contains no graph from F as a subgraph. For a positive integer 𝑛, the planar Turán number of F, denoted by exp (𝑛, F), is the maximum number of edges in an 𝑛-vertex F -free planar graph.Let Θ
- Open Access
Book free $3$-Uniform Hypergraphs
A $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$.Open AccessBook free $3$-Uniform Hypergraphs
A $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$. - 28 August 2023
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 49 (5) , 1-10
The Minimum Number of 4-Cycles in a Maximal Planar Graph with Small Number of Vertices
- 28 August 2023
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 49 (5) , 1-10
The Minimum Number of 4-Cycles in a Maximal Planar Graph with Small Number of Vertices
- Open AccessPlanar Turán Number of the $Θ_6$Let $\mathcal{F}$ be a nonempty family of graphs. A graph $G$ is called $\mathcal{F}$-\textit{free} if it contains no graph from $\mathcal{F}$ as a subgraph. For a positive integer $n$, the \emph{planar Tur\'an number} of $\F$, denoted by $\ex_{\p}(n,\F)$, is the maximum number of edges in an $n$-vertex $\F$-free planar graph. Let $\Theta_k$ be the family of Theta graphs on $k\geq 4$ vertices, that is, graphs obtained by joining a pair of non-consecutive vertices of a $k$-cycle with an edge. Lan, Shi and Song determined an upper bound $\text{ex}_{\mathcal{P}}(n,\Theta_6)\leq \frac{18}{7}n-\frac{36}{7}$, but for large $n$, they did not verify that the bound is sharp. In this paper, we improve their bound by proving $\text{ex}_{\mathcal{P}}(n,\Theta_6)\leq \frac{18}{7}n-\frac{48}{7}$ and then we demonstrate the existence of infinitely many positive integer $n$ and an $n$-vertex $\Theta_6$-free planar graph attaining the bound.Open AccessPlanar Turán Number of the $Θ_6$Let $\mathcal{F}$ be a nonempty family of graphs. A graph $G$ is called $\mathcal{F}$-\textit{free} if it contains no graph from $\mathcal{F}$ as a subgraph. For a positive integer $n$, the \emph{planar Tur\'an number} of $\F$, denoted by $\ex_{\p}(n,\F)$, is the maximum number of edges in an $n$-vertex $\F$-free planar graph. Let $\Theta_k$ be the family of Theta graphs on $k\geq 4$ vertices, that is, graphs obtained by joining a pair of non-consecutive vertices of a $k$-cycle with an edge. Lan, Shi and Song determined an upper bound $\text{ex}_{\mathcal{P}}(n,\Theta_6)\leq \frac{18}{7}n-\frac{36}{7}$, but for large $n$, they did not verify that the bound is sharp. In this paper, we improve their bound by proving $\text{ex}_{\mathcal{P}}(n,\Theta_6)\leq \frac{18}{7}n-\frac{48}{7}$ and then we demonstrate the existence of infinitely many positive integer $n$ and an $n$-vertex $\Theta_6$-free planar graph attaining the bound.
- Open Access
The Minimum Number of $4$-Cycles in a Maximal Planar Graph with Small Number of Vertices
Hakimi and Schmeichel determined a sharp lower bound for the number of cycles of length 4 in a maximal planar graph with $n$ vertices, $n\geq 5$. It has been shown that the bound is sharp for $n = 5,12$ and $n\geq 14$ vertices. However, the authors only conjectured the minimum number of cycles of length 4 for maximal planar graphs with the remaining small vertex numbers. In this note, we confirm their conjecture.Open AccessThe Minimum Number of $4$-Cycles in a Maximal Planar Graph with Small Number of Vertices
Hakimi and Schmeichel determined a sharp lower bound for the number of cycles of length 4 in a maximal planar graph with $n$ vertices, $n\geq 5$. It has been shown that the bound is sharp for $n = 5,12$ and $n\geq 14$ vertices. However, the authors only conjectured the minimum number of cycles of length 4 for maximal planar graphs with the remaining small vertex numbers. In this note, we confirm their conjecture. - 10 January 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (5) , 112779
Inverse Turán numbers
- 10 January 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (5) , 112779
Inverse Turán numbers
- Open Access
The Maximum Number of Paths of Length Four in a Planar Graph
Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{\frac{k-1}{2}}\rfloor}+1}$. In this paper we determine the asymptotic value of $f(n,P_5)$ and give conjectures for longer paths.Open AccessThe Maximum Number of Paths of Length Four in a Planar Graph
Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{\frac{k-1}{2}}\rfloor}+1}$. In this paper we determine the asymptotic value of $f(n,P_5)$ and give conjectures for longer paths. - Open Access
The maximum number of induced $C_5$'s in a planar graph
Finding the maximum number of induced cycles of length $k$ in a graph on $n$ vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, Hu, Lidick\'{y} and Pfender answered the question in the case $k=5$. In this paper we determine precisely, for all sufficiently large $n$, the maximum number of induced $5$-cycles that an $n$-vertex planar graph can contain.Open AccessThe maximum number of induced $C_5$'s in a planar graph
Finding the maximum number of induced cycles of length $k$ in a graph on $n$ vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, Hu, Lidick\'{y} and Pfender answered the question in the case $k=5$. In this paper we determine precisely, for all sufficiently large $n$, the maximum number of induced $5$-cycles that an $n$-vertex planar graph can contain. - Open Access
Inverse Turán numbers
For given graphs $G$ and $F$, the Tur\'an number $ex(G,F)$ is defined to be the maximum number of edges in an $F$-free subgraph of $G$. Foucaud, Krivelevich and Perarnau and later independently Briggs and Cox introduced a dual version of this problem wherein for a given number $k$, one maximizes the number of edges in a host graph $G$ for which $ex(G,H) < k$. Addressing a problem of Briggs and Cox, we determine the asymptotic value of the inverse Tur\'an number of the paths of length $4$ and $5$ and provide an improved lower bound for all paths of even length. Moreover, we obtain bounds on the inverse Tur\'an number of even cycles giving improved bounds on the leading coefficient in the case of $C_4$. Finally, we give multiple conjectures concerning the asymptotic value of the inverse Tur\'an number of $C_4$ and $P_{\ell}$, suggesting that in the latter problem the asymptotic behavior depends heavily on the parity of $\ell$.Open AccessInverse Turán numbers
For given graphs $G$ and $F$, the Tur\'an number $ex(G,F)$ is defined to be the maximum number of edges in an $F$-free subgraph of $G$. Foucaud, Krivelevich and Perarnau and later independently Briggs and Cox introduced a dual version of this problem wherein for a given number $k$, one maximizes the number of edges in a host graph $G$ for which $ex(G,H) < k$. Addressing a problem of Briggs and Cox, we determine the asymptotic value of the inverse Tur\'an number of the paths of length $4$ and $5$ and provide an improved lower bound for all paths of even length. Moreover, we obtain bounds on the inverse Tur\'an number of even cycles giving improved bounds on the leading coefficient in the case of $C_4$. Finally, we give multiple conjectures concerning the asymptotic value of the inverse Tur\'an number of $C_4$ and $P_{\ell}$, suggesting that in the latter problem the asymptotic behavior depends heavily on the parity of $\ell$. - Open Access
A note on the Turán number of disjoint union of wheels
The Tur\'an number of a graph $H$, $\text{ex}(n,H)$, is the maximum number of edges in a graph on $n$ vertices which does not have $H$ as a subgraph. A wheel $W_n$ is an $n$-vertex graph formed by connecting a single vertex to all vertices of a cycle $C_{n-1}$. Let $mW_{2k+1}$ denote the $m$ vertex-disjoint copies of $W_{2k+1}$. For sufficiently large $n$, we determine the Tur\'an number and all extremal graphs for $mW_{2k+1}$. We also provide the Tur\'an number and all extremal graphs for $W^{h}:=\bigcup\limits^m_{i=1}W_{k_i}$ when $n$ is sufficiently large, where the number of even wheels is $h$ and $h>0$.Open AccessA note on the Turán number of disjoint union of wheels
The Tur\'an number of a graph $H$, $\text{ex}(n,H)$, is the maximum number of edges in a graph on $n$ vertices which does not have $H$ as a subgraph. A wheel $W_n$ is an $n$-vertex graph formed by connecting a single vertex to all vertices of a cycle $C_{n-1}$. Let $mW_{2k+1}$ denote the $m$ vertex-disjoint copies of $W_{2k+1}$. For sufficiently large $n$, we determine the Tur\'an number and all extremal graphs for $mW_{2k+1}$. We also provide the Tur\'an number and all extremal graphs for $W^{h}:=\bigcup\limits^m_{i=1}W_{k_i}$ when $n$ is sufficiently large, where the number of even wheels is $h$ and $h>0$.