Results 71 to 80 of about 256,047 (323)

Large monochromatic components and long monochromatic cycles in random hypergraphs [PDF]

open access: yesEuropean Journal of Combinatorics, 2019
We extend results of Gyárfás and Füredi on the largest monochromatic component in $r$-colored complete $k$-uniform hypergraphs to the setting of random hypergraphs. We also study long monochromatic loose cycles in $r$-colored random hypergraphs. In particular, we obtain a random analog of a result of Gyárfás, Sárközy, and Szemerédi on the longest ...
Patrick Bennett   +3 more
openaire   +3 more sources

Monochromatic sums and products in $\mathbb{N}$ [PDF]

open access: yes, 2016
An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear patterns which can be
Joel Moreira
semanticscholar   +1 more source

Vertex covers by monochromatic pieces - A survey of results and problems [PDF]

open access: yesDiscrete Mathematics, 2015
This survey is devoted to problems and results concerning covering the vertices of edge colored graphs or hypergraphs with monochromatic paths, cycles and other objects.
A. Gyárfás
semanticscholar   +1 more source

Enhancing Low‐Temperature Performance of Sodium‐Ion Batteries via Anion‐Solvent Interactions

open access: yesAdvanced Functional Materials, EarlyView.
DOL is introduced into electrolytes as a co‐solvent, increasing slat solubility, ion conductivity, and the de‐solvent process, and forming an anion‐rich solvent shell due to its high interaction with anion. With the above virtues, the batteries using this electrolyte exhibit excellent cycling stability at low temperatures. Abstract Sodium‐ion batteries
Cheng Zheng   +7 more
wiley   +1 more source

Monochromatic infinite paths

open access: yesDiscrete Mathematics, 1993
Let \(K_\omega\) denote the complete graph on the natural numbers. It is shown that if the edges of \(K_\omega\) are colored with 2 colors, then there is a monochromatic infinite path \(P\) with upper density \(\geq 2/3\), where the upper density for \(P\) is \(\limsup_{n\to\infty}|V(P)\cap\{1,2,\dots,n\}|/n\).
Paul Erdös, Fred Galvin
openaire   +2 more sources

Effect of Spectral Quality of Monochromatic LED Lights on the Growth of Artichoke Seedlings

open access: yesFrontiers in Plant Science, 2017
Indoor farming is becoming a popular alternative approach in food production to meet the demand of a growing world population. Under this production system, artificial light provides the main source of illumination in sustaining plant growth and ...
R. Rabara   +3 more
semanticscholar   +1 more source

On‐Surface Indigo‐Based Bimolecular Coordination Networks with Programmable Regular or Vitreous Structure

open access: yesAdvanced Functional Materials, Volume 36, Issue 43, 29 May 2026.
A previously unreported coordination motif stabilising single Fe atoms by indigo chelation and pyridyl coordination on Au(111) has been revealed. By using planar tritopic pyridyl linkers (TPyB), extended 2D porous networks of indigo3(TPyB)2Fe6 form. These networks can be crystalline or vitreous and offer an environment where individual coordination ...
Hongxiang Xu   +9 more
wiley   +1 more source

On monochromatic ascending waves [PDF]

open access: yes, 2012
see the abstract in the attached ...
LeSaulnier, Tim, Robertson, Aaron
openaire   +2 more sources

Nanoscale Mapping of Plasmonic Charge Transport in Nano‐Resonators Based on Resistive Switching Materials

open access: yesAdvanced Functional Materials, EarlyView.
In this strategy, a conductive nano‐probe is employed to induce nanoscale phase transitions and map the nanoscale conductivity and trap density of GST films. By utilizing the contrasting properties of phase‐change states, nano‐resonators are fabricated that exhibit plasmonic conduction and dramatically different transport characteristics.
Sunwoo Bang   +4 more
wiley   +1 more source

γ-Cycles In Arc-Colored Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
We call a digraph D an m-colored digraph if the arcs of D are colored with m colors. A directed path (or a directed cycle) is called monochromatic if all of its arcs are colored alike.
Galeana-Sánchez Hortensia   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy