To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The book graph $B_n ^{(k)}$ consists of $n$ copies of $K_{k+1}$ joined along a common $K_k$. In the prequel to this paper, we studied the diagonal Ramsey number $r(B_n ^{(k)}, B_n ^{(k)})$. Here we consider the natural off-diagonal variant $r(B_{cn} ^{(k)}, B_n^{(k)})$ for fixed $c \in (0,1]$. In this more general setting, we show that an interesting dichotomy emerges: for very small $c$, a simple $k$-partite construction dictates the Ramsey function and all nearly-extremal colourings are close to being $k$-partite, while, for $c$ bounded away from $0$, random colourings of an appropriate density are asymptotically optimal and all nearly-extremal colourings are quasirandom. Our investigations also open up a range of questions about what happens for intermediate values of $c$.
Finite element methods developed for unfitted meshes have been widely applied to various interface problems. However, many of them resort to non-conforming spaces for approximation, which is a critical obstacle for the extension to $\textbf{H}(\text{curl})$ equations. This essential issue stems from the underlying Sobolev space $\textbf{H}^s(\text{curl};\,\Omega)$, and even the widely used penalty methodology may not yield the optimal convergence rate. One promising approach to circumvent this issue is to use a conforming test function space, which motivates us to develop a Petrov–Galerkin immersed finite element (PG-IFE) method for $\textbf{H}(\text{curl})$-elliptic interface problems. We establish the Nédélec-type IFE spaces and develop some important properties including their edge degrees of freedom, an exact sequence relating to the $H^1$ IFE space and optimal approximation capabilities. We analyse the inf-sup condition under certain assumptions and show the optimal convergence rate, which is also validated by numerical experiments.