Two conjectures in Ramsey-Tur\'an theory

Given graphs $H_1,\ldots, H_k$, a graph $G$ is $(H_1,\ldots, H_k)$-free if there is a $k$-edge-colouring $\phi:E(G)\rightarrow [k]$ with no monochromatic copy of $H_i$ with edges of colour $i$ for each $i\in[k]$. Fix a function $f(n)$, the Ramsey-Tur\'an function $\textrm{RT}(n,H_1,\ldots,H_k,f(n))$ is the maximum number of edges in an $n$-vertex $(H_1,\ldots,H_k)$-free graph with independence number at most $f(n)$. We determine $\textrm{RT}(n,K_3,K_s,\delta n)$ for $s\in\{3,4,5\}$ and sufficiently small $\delta$, confirming a conjecture of Erd\H{o}s and S\'os from 1979. It is known that $\textrm{RT}(n,K_8,f(n))$ has a phase transition at $f(n)=\Theta(\sqrt{n\log n})$. However, the values of $\textrm{RT}(n,K_8, o(\sqrt{n\log n}))$ was not known. We determined this value by proving $\textrm{RT}(n,K_8,o(\sqrt{n\log n}))=\frac{n^2}{4}+o(n^2)$, answering a question of Balogh, Hu and Simonovits. The proofs utilise, among others, dependent random choice and results from graph packings.Comment: 20 pages, 2 figures, 2 pages appendi

Quantum Random Number Generator using Photon-Number Path Entanglement

We report a novel quantum random number generator based on the photon-number$-$path entangled state which is prepared via two-photon quantum interference at a beam splitter. The randomness in our scheme is of truly quantum mechanical origin as it comes from the projection measurement of the entangled two-photon state. The generated bit sequences satisfy the standard randomness test

THE COST-EFFECTIVENESS OF ALTERNATIVE EMISSION CONTROL POLICIES IN THE SAN JOAQUIN VALLEY OF CALIFORNIA

This study analyzes the ROG control costs of stationary sources in the San Joaquin Valley of California. The cost-effectiveness of market incentive approaches such as an uniform marketable permit system, localized marketable permit system and an ambient permit system as well as a traditional command-and-control approach are examined.Environmental Economics and Policy,