Results 61 to 70 of about 2,225,625 (302)
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 Materials, EarlyView.A giant insulator to metal transition and emergent superparamagnetism are revealed by nanoparticle exsolution in non‐stoichiometric titanate perovskite thin films. By combining transport, synchrotron spectroscopy, and first‐principles calculations, this work reveals how defect reconfiguration and lattice reconstruction fundamentally reshape electronic ...
Sungil Kim +11 more
wiley +1 more source
Hamilton College Library Home Notes [PDF]
, 2010 Communal Societies Collection: New Acquisitions The Communal Societies Collection of the Hamilton College Library is now home to the world’s most extensive collection of materials relating to the House of David and Mary’s City of David communities ...
core +2 more sources
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
The number of cycles in a hamilton graph
Discrete Mathematics, 1994 Let \(f(G)\) denote the number of distinct cycles of a graph \(G\). Let \(\Gamma_ k\) be the collection of all Hamiltonian simple graphs of order \(n\) and size \(n+k\). Let \[ m(k)= \min\{f(G);\;G\in \Gamma_ k\},\quad M(k)= \max\{f(G);\;G\in \Gamma_ k\}. \] The reviewer and S. K.
openaire +2 more sources
Rainbow Hamilton cycles and lopsidependency
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas J. A. Harvey, Christopher Liaw
openaire +1 more source
Navigating Lipid Nanostructure Design Space Through Continuous Microfluidic Automation
Advanced Materials, EarlyView.LipidXplorer is a novel microfluidic platform which enables rapid navigation of lipid particle design space for high‐resolution phase mapping, lipid nanoparticle optimization, membrane biophysics, and functional nanomaterial discovery. It combines programmable composition control, continuous nanoparticle formation, and automated well‐plate collection ...
Bradley Diggines +10 more
wiley +1 more source
Dating the business cycle: Evidence from Mongolia
Central Bank Review, 2019 Business cycle is an important indicator for making policy and management decisions. This paper compares the business cycle estimates for Mongolia based on a graphical and parametric methods.
Davaajargal Luvsannyam +2 more
doaj +1 more source
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.
Béla Bollobás, Roland Häggkvist
openaire +2 more sources
Asians at Hamilton: The Asian and Asian American Experience
, 2021 This project looks to examine the experiences of Asian and Asian Americans at Hamilton College from a holistic ...
Nguyen-Haberneski, Maya, \u2723 +10 more
core