Contraction blockers for graphs with forbidden induced paths.

We consider the following problem: can a certain graph parameter of some given graph be reduced by at least d for some integer d via at most k edge contractions for some given integer k? We examine three graph parameters: the chromatic number, clique number and independence number. For each of these graph parameters we show that, when d is part of the input, this problem is polynomial-time solvable on P4-free graphs and NP-complete as well as W[1]-hard, with parameter d, for split graphs. As split graphs form a subclass of P5-free graphs, both results together give a complete complexity classification for Pℓ-free graphs. The W[1]-hardness result implies that it is unlikely that the problem is fixed-parameter tractable for split graphs with parameter d. But we do show, on the positive side, that the problem is polynomial-time solvable, for each parameter, on split graphs if d is fixed, i.e., not part of the input. We also initiate a study into other subclasses of perfect graphs, namely cobipartite graphs and interval graphs

Reducing the clique and chromatic number via edge contractions and vertex deletions.

We consider the following problem: can a certain graph parameter of some given graph G be reduced by at least d, for some integer d, via at most k graph operations from some specified set S, for some given integer k? As graph parameters we take the chromatic number and the clique number. We let the set S consist of either an edge contraction or a vertex deletion. As all these problems are NP-complete for general graphs even if d is fixed, we restrict the input graph G to some special graph class. We continue a line of research that considers these problems for subclasses of perfect graphs, but our main results are full classifications, from a computational complexity point of view, for graph classes characterized by forbidding a single induced connected subgraph H

Reducing the clique and chromatic number via edge contractions and vertex deletions

We consider the following problem: can a certain graph parameter of some given graph G be reduced by at least d, for some integer d, via at most k graph operations from some specified set S, for some given integer k? As graph parameters we take the chromatic number and the clique number. We let the set S consist of either an edge contraction or a vertex deletion. As all these problems are NP-complete for general graphs even if d is fixed, we restrict the input graph G to some special graph class. We continue a line of research that considers these problems for subclasses of perfect graphs, but our main results are full classifications, from a computational complexity point of view, for graph classes characterized by forbidding a single induced connected subgraph H

Contraction blockers for graphs with forbidden induced paths

We consider the following problem: can a certain graph parameter of some given graph be reduced by at least d for some integer d via at most k edge contractions for some given integer k? We examine three graph parameters: the chromatic number, clique number and independence number. For each of these graph parameters we show that, when d is part of the input, this problem is polynomial-time solvable on P4-free graphs and NP-complete as well as W[1]-hard, with parameter d, for split graphs. As split graphs form a subclass of P5-free graphs, both results together give a complete complexity classification for Pℓ-free graphs. The W[1]-hardness result implies that it is unlikely that the problem is fixed-parameter tractable for split graphs with parameter d. But we do show, on the positive side, that the problem is polynomial-time solvable, for each parameter, on split graphs if d is fixed, i.e., not part of the input. We also initiate a study into other subclasses of perfect graphs, namely cobipartite graphs and interval graphs

SPHERE: the exoplanet imager for the Very Large Telescope

Observations of circumstellar environments to look for the direct signal of exoplanets and the scattered light from disks has significant instrumental implications. In the past 15 years, major developments in adaptive optics, coronagraphy, optical manufacturing, wavefront sensing and data processing, together with a consistent global system analysis have enabled a new generation of high-contrast imagers and spectrographs on large ground-based telescopes with much better performance. One of the most productive is the Spectro-Polarimetic High contrast imager for Exoplanets REsearch (SPHERE) designed and built for the ESO Very Large Telescope (VLT) in Chile. SPHERE includes an extreme adaptive optics system, a highly stable common path interface, several types of coronagraphs and three science instruments. Two of them, the Integral Field Spectrograph (IFS) and the Infra-Red Dual-band Imager and Spectrograph (IRDIS), are designed to efficiently cover the near-infrared (NIR) range in a single observation for efficient young planet search. The third one, ZIMPOL, is designed for visible (VIR) polarimetric observation to look for the reflected light of exoplanets and the light scattered by debris disks. This suite of three science instruments enables to study circumstellar environments at unprecedented angular resolution both in the visible and the near-infrared. In this work, we present the complete instrument and its on-sky performance after 4 years of operations at the VLT.Comment: Final version accepted for publication in A&

Stiffening and unfolding of early deposited-fibronectin increase proangiogenic factor secretion by breast cancer-associated stromal cells.

Fibronectin (Fn) forms a fibrillar network that controls cell behavior in both physiological and diseased conditions including cancer. Indeed, breast cancer-associated stromal cells not only increase the quantity of deposited Fn but also modify its conformation. However, (i) the interplay between mechanical and conformational properties of early tumor-associated Fn networks and (ii) its effect on tumor vascularization remain unclear. Here, we first used the Surface Forces Apparatus to reveal that 3T3-L1 preadipocytes exposed to tumor-secreted factors generate a stiffer Fn matrix relative to control cells. We then show that this early matrix stiffening correlates with increased molecular unfolding in Fn fibers, as determined by Förster Resonance Energy Transfer. Finally, we assessed the resulting changes in adhesion and proangiogenic factor (VEGF) secretion of newly seeded 3T3-L1s, and we examined altered integrin specificity as a potential mechanism of modified cell-matrix interactions through integrin blockers. Our data indicate that tumor-conditioned Fn decreases adhesion while enhancing VEGF secretion by preadipocytes, and that an integrin switch is responsible for such changes. Collectively, our findings suggest that simultaneous stiffening and unfolding of initially deposited tumor-conditioned Fn alters both adhesion and proangiogenic behavior of surrounding stromal cells, likely promoting vascularization and growth of the breast tumor. This work enhances our knowledge of cell - Fn matrix interactions that may be exploited for other biomaterials-based applications, including advanced tissue engineering approaches

The success probability in Levine's hat problem, and independent sets in graphs

Lionel Levine's hat challenge has $t$ players, each with a (very large, or infinite) stack of hats on their head, each hat independently colored at random black or white. The players are allowed to coordinate before the random colors are chosen, but not after. Each player sees all hats except for those on her own head. They then proceed to simultaneously try and each pick a black hat from their respective stacks. They are proclaimed successful only if they are all correct. Levine's conjecture is that the success probability tends to zero when the number of players grows. We prove that this success probability is strictly decreasing in the number of players, and present some connections to problems in graph theory: relating the size of the largest independent set in a graph and in a random induced subgraph of it, and bounding the size of a set of vertices intersecting every maximum-size independent set in a graph.Comment: arXiv admin note: substantial text overlap with arXiv:2103.01541, arXiv:2103.0599