Results 191 to 200 of about 579 (230)
Some of the next articles are maybe not open access.

On the fractional Lazer-McKenna conjecture with critical growth

Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 2021
This paper deals with the following fractional elliptic equation with critical exponent \[ \begin{cases} \displaystyle (-\Delta )^{s}u=u_{+}^{2_{s}^{*}-1}+\lambda u-\bar{\nu}\varphi_{1}, & \text{in}\ \Omega,\\ \displaystyle u=0, & \text{in}\ {{\mathfrak R}}^{N}\backslash \Omega, \end{cases}\] where $\lambda$, $\bar {\nu }\in {{\mathfrak R ...
Li, Qi, Peng, Shuangjie
openaire   +2 more sources

Mader’s Conjecture On Extremely Critical Graphs

Combinatorica, 2006
A non-complete graph G is called an (n,k)-graph if it is n-connected but G—X is not (n−|X|+1)-connected for any X ⊂ V (G) with |X|≤k. Mader conjectured that for k≥3 the graph K2k+2−(1−factor) is the unique (2k,k)-graph(up to isomorphism).Here we prove this conjecture.
openaire   +1 more source

All My Favorite Conjectures Are Critical

2016
My favorite graph theory conjectures involve the effects of edge removal on the diameter of a graph and the effects of edge addition on the domination and total domination numbers of a graph. Loosely speaking, “criticality” means that the value of the parameter in question always changes under the graph modification.
openaire   +1 more source

Lazer-McKenna Conjecture for fractional problems involving critical growth

Journal of Differential Equations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benniao Li, Wei Long, Zhongwei Tang
openaire   +2 more sources

The rise and fall of the critical graph conjecture

Journal of Graph Theory, 1983
AbstractIn this expository paper we discuss the critical graph conjecture and its eventual disproof by M.K. Goldberg and others.
Chetwynd, Amanda G., Wilson, Robin J.
openaire   +2 more sources

Home - About - Disclaimer - Privacy