Results 51 to 60 of about 60,523 (284)
Powers of Hamilton cycles in tournaments
Journal of Combinatorial Theory, Series B, 1990 AbstractOur main aim is to show that for every ε > 0 and k ∈ N there is an n(ε, k) such that if T is a tournament of order n ≥n(ε, k) and in T every vertex has indegree at least (14+ε)n and at most (34−ε)n then T contains the kth power of a Hamilton cycle.
Roland Häggkvist, Béla Bollobás
openaire +2 more sources
Advanced Functional Materials, EarlyView.A well‐modulated CeO2/Fe3C heterostructure is successfully constructed. The electron redistribution induced by CeO2 not only enhances the formation energy of Fe vacancies and hinders the dissolution of Fe but also reduces the energy barrier of the ORR.
Peng Wang +8 more
wiley +1 more source
Electrolyte Engineering Strategy with Catecholate Type Additive Enabled Ultradurable Zn Anode
Advanced Functional Materials, EarlyView.A catecholate‐type molecule is proposed as a multifunctional electrolyte additive, providing a strong buffering ability as well as homogeneous (101)‐textured electroplating morphology. The modified Zn anode exhibits a remarkable rate capability, extraordinary reversibility, and superior cyclic stability.
Wenyu Liang +9 more
wiley +1 more source
A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2016 Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K)
Wideł Wojciech
doaj +1 more source
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +1 more source
Advanced Functional Materials, EarlyView.A potent anionic citric acid‐based 3D‐printed scaffold is developed for the sustained and controlled release of orthobiologics to enhance orthopedic therapeutic efficacy. Comprehensive in vivo studies demonstrated effective bone fusion and high safety at a low dose of BMP‐2 delivered by the system, establishing it as a promising platform for safe ...
Se‐Hwan Lee +12 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
Hamiltonicity and Generalised Total Colourings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 The total generalised colourings considered in this paper are colourings of graphs such that the vertices and edges of the graph which receive the same colour induce subgraphs from two prescribed hereditary graph properties while incident elements ...
Borowiecki Mieczysław, Broere Izak
doaj +1 more source
On covering expander graphs by hamilton cycles [PDF]
Random Structures & Algorithms, 2012 AbstractThe problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree Δ satisfies some basic expansion properties and contains a family of edge disjoint Hamilton cycles ...
Michael Krivelevich +2 more
openaire +2 more sources
Heavy and Light Paths and Hamilton Cycles
SSRN Electronic Journal, 2022 Given a graph $G$, we denote by $f(G,u_0,k)$ the number of paths of length $k$ in $G$ starting from $u_0$. In graphs of maximum degree 3, with edge weights $i.i.d.$ with $exp(1)$, we provide a simple proof showing that (under the assumption that $f(G,u_0,k)=ω(1)$) the expected weight of the heaviest path of length $k$ in $G$ starting from $u_0$ is at ...
Sahar Diskin, Dor Elboim
openaire +2 more sources