More Like this

1. Transversal C_k -factors in subgraphs of the balanced blow-up of C_k

   https://doi.org/10.1017/S0963548322000086  

   Ergemlidze, Beka; Molla, Theodore (November 2022, Combinatorics, Probability and Computing)

   Abstract For a subgraph$$G$$of the blow-up of a graph$$F$$, we let$$\delta ^*(G)$$be the smallest minimum degree over all of the bipartite subgraphs of$$G$$induced by pairs of parts that correspond to edges of$$F$$. Johansson proved that if$$G$$is a spanning subgraph of the blow-up of$$C_3$$with parts of size$$n$$and$$\delta ^*(G) \ge \frac{2}{3}n + \sqrt{n}$$, then$$G$$contains$$n$$vertex disjoint triangles, and presented the following conjecture of Häggkvist. If$$G$$is a spanning subgraph of the blow-up of$$C_k$$with parts of size$$n$$and$$\delta ^*(G) \ge \left(1 + \frac 1k\right)\frac n2 + 1$$, then$$G$$contains$$n$$vertex disjoint copies of$$C_k$$such that each$$C_k$$intersects each of the$$k$$parts exactly once. A similar conjecture was also made by Fischer and the case$$k=3$$was proved for large$$n$$by Magyar and Martin. In this paper, we prove the conjecture of Häggkvist asymptotically. We also pose a conjecture which generalises this result by allowing the minimum degree conditions in each bipartite subgraph induced by pairs of parts of$$G$$to vary. We support this new conjecture by proving the triangle case. This result generalises Johannson’s result asymptotically. 

   more » « less
2. Crafting Spin-State Switchable Strain Profiles within Rb _x Co[Fe(CN) ₆ ] _y @K _j Ni[Cr(CN) ₆ ] _k Heterostructures

   https://doi.org/10.1021/acs.chemmater.0c03608  

   Cain, John M.; Felts, Ashley C.; Meisel, Mark W.; Talham, Daniel R. (January 2021, Chemistry of Materials)

   null (Ed.)
3. Making K _r+1 -free graphs r -partite

   https://doi.org/10.1017/S0963548320000590  

   Balogh, József; Clemen, Felix Christian; Lavrov, Mikhail; Lidický, Bernard; Pfender, Florian (July 2021, Combinatorics, Probability and Computing)

   null (Ed.)

   Abstract The Erdős–Simonovits stability theorem states that for all ε > 0 there exists α > 0 such that if G is a K r+ 1 -free graph on n vertices with e ( G ) > ex( n , K r +1 )– α n 2 , then one can remove εn 2 edges from G to obtain an r -partite graph. Füredi gave a short proof that one can choose α = ε . We give a bound for the relationship of α and ε which is asymptotically sharp as ε → 0. 

   more » « less
4. The factorisation property of l ^∞ ( X_k )

   https://doi.org/10.1017/s0305004120000304  

   LECHNER, RICHARD; MOTAKIS, PAVLOS; MÜLLER, PAUL F.X.; SCHLUMPRECHT, THOMAS (September 2021, Mathematical Proceedings of the Cambridge Philosophical Society)

   Abstract In this paper we consider the following problem: let X k , be a Banach space with a normalised basis ( e (k, j) ) j , whose biorthogonals are denoted by $${(e_{(k,j)}^*)_j}$$ , for $$k\in\N$$ , let $$Z=\ell^\infty(X_k:k\kin\N)$$ be their l ∞ -sum, and let $$T:Z\to Z$$ be a bounded linear operator with a large diagonal, i.e. , $$\begin{align*}\inf_{k,j} \big|e^*_{(k,j)}(T(e_{(k,j)})\big|>0.\end{align*}$$ Under which condition does the identity on Z factor through T ? The purpose of this paper is to formulate general conditions for which the answer is positive. 

   more » « less
5. Determining the Surface p K _a of Perfluorooctanoic Acid

   https://doi.org/10.1021/acs.jpcc.3c07235  

   Musegades, Lila J.; Curtin, Owen P.; Cyran, Jenée D. (January 2024, The Journal of Physical Chemistry C)