No abstract uploaded!

No abstract uploaded!

In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169 \,\ (r\geq 1)$ and $n \geq 540t^{2}+\frac{175811}{2}t+\frac{7989}{2}$. Consequently, $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + {2 \over 5}},$ which is better than the previous bounds $\sqrt 2$ (see [2]), $\sqrt {2+{2562\over 6911}}$ (see [7]).

In this paper, we develop a class of nonlinear compact schemes based on our previous linear central compact schemes with spectral-like resolution [X. Liu, S. Zhang, H. Zhang and C-W. Shu, A new class of central compact schemes with spectral-like resolution I: Linear schemes, Journal of Computational Physics 248 (2013) 235-256]. In our approach, we compute the flux derivatives on the cell-nodes by the physical fluxes on the cell nodes and numerical fluxes on the cell centers. To acquire the numerical fluxes on the cell centers, we perform a weighted hybrid interpolation of an upwind interpolation and a central interpolation. Through systematic analysis and numerical tests, we show that our nonlinear compact scheme has high order, high resolution and low dissipation, and has the same ability to capture strong discontinuities as regular weighted essentially non-oscillatory (WENO) schemes. It is a good choice for the simulation of multiscale problems with shock waves.

No abstract uploaded!