Dániel Lenger
YOU?
Author Swipe
View article: On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory Open
We study exak(n,F), the largest number of edges in an n-vertex graph that contains exactly k copies of a given subgraph F. The case k=0 is the Turán number ex(n,F) that is among the most studied parameters in extremal graph theory. We show…
View article: On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory Open
We study $\mathrm{exa}_k(n,F)$, the largest number of edges in an $n$-vertex graph $G$ that contains exactly $k$ copies of a given subgraph $F$. The case $k=0$ is the Turán number $\mathrm{ex}(n,F)$ that is among the most studied parameter…
View article: A plurality problem with three colors and query size three
A plurality problem with three colors and query size three Open
The Plurality problem - introduced by Aigner - has many variants. In this article we deal with the following version: suppose we are given n balls, each of them colored by one of three colors. A plurality ball is one such that its color cl…
View article: Postoperative chemoradiotherapy with cisplatin is superior to radioimmunotherapy with cetuximab and radiotherapy alone
Postoperative chemoradiotherapy with cisplatin is superior to radioimmunotherapy with cetuximab and radiotherapy alone Open
Summary Background The addition of cisplatin or cetuximab to radiotherapy in patients with locally advanced squamous cell carcinoma of the head and neck (SCCHN) has significantly improved the outcome. While the superiority of cisplatin ove…
View article: Upper bounds for the necklace folding problems
Upper bounds for the necklace folding problems Open
A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…
View article: A plurality problem with three colors and query size three
A plurality problem with three colors and query size three Open
The Plurality problem - introduced by Aigner \cite{A2004} - has many variants. In this article we deal with the following version: suppose we are given $n$ balls, each of them colored by one of three colors. A \textit{plurality ball} is on…