Results 81 to 90 of about 4,036,327 (265)
Hamilton $\ell$-Cycles in Randomly Perturbed Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2018 We prove that for integers $2 \leqslant \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly 'perturbed' by changing non-edges to edges independently at random with probability $p \geqslant O(n^{-(k-\ell)-c})$, then with high probability the resulting $k$-uniform hypergraph contains a Hamilton ...
McDowell, Andrew, Mycroft, Richard
openaire +3 more sources
Bioengineered 3D hPSC‐Cholangiocyte Ducts With Physiological Signals for Biliary Disease Modeling
Advanced Healthcare Materials, EarlyView.Tian and colleagues generated a bioengineered bile duct from human pluripotent stem cell (hPSC)‐derived intrahepatic cholangiocytes within a high‐throughput, 384‐well platform to systematically examine the influence of biliary physiological signals including fluid flow, stromal cells and bile acids, and models intrahepatic biliary disease progression ...
Britney Tian +10 more
wiley +1 more source
A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2017 A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj +1 more source
k-Ordered Hamilton cycles in digraphs
Journal of Combinatorial Theory, Series B, 2008 Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which encounters these vertices in this order.
Kühn, Daniela +2 more
openaire +2 more sources
Advanced Healthcare Materials, EarlyView.A versatile approach is presented for fabricating smart multifunctional textiles by integrating thermo‐fluorescent carbon dot/polymer nanocomposite coatings with 3D‐printed interlocked architectures. The fabrics exhibit temperature‐responsive fluorescence, durable hydrophobicity, strong antibacterial and antioxidant activity, and enhanced UV protection.
Poushali Das +8 more
wiley +1 more source
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source
Counting Hamilton cycles in sparse random directed graphs
, 2018 Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\ge(\log n+\omega(1))/n$ then D(n,p) typically has a directed Hamilton
Alon book N. +7 more
core +1 more source
Hamilton Cycles, Minimum Degree, and Bipartite Holes [PDF]
Journal of Graph Theory, 2017 AbstractWe present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large “bipartite hole” (two disjoint sets of vertices with no edges between them). This result extends Dirac's classical theorem, and is related to a theorem of Chvátal and Erdős.
McDiarmid, C, Yolov, N
openaire +3 more sources
Azaporphyrinoid‐Based Photo‐ and Electroactive Architectures for Advanced Functional Materials
Advanced Materials, EarlyView.A long‐standing collaboration between the Torres and Guldi groups has yielded diverse azaporphyrinoid‐based donor‐acceptor nanohybrids with promising applications in solar energy conversion. This conspectus highlights key molecular platforms and structure‐function relationships that govern light and charge management, supporting the rational design of ...
Jorge Labella +3 more
wiley +1 more source
A short proof of the middle levels theorem
Discrete Analysis, 2018 A short proof of the middle-levels theorem, Discrete Analysis 2018:8, 12 pp. Let $n$ be a positive integer, and define a bipartite graph where one vertex set consists of all subsets of $\{1,2,\dots,2n+1\}$ of size $n$, the other consists of all subsets ...
Petr Gregor +2 more
doaj +1 more source