Results 241 to 250 of about 24,507 (264)

Homogeneous Set in Multigraph with Forbidden Coloring

The Erdos–Hajnal conjecture predicts that forbidding any fixed induced subgraph H in a graph on n vertices forces a clique or independent set of size at least n^ε for some ε > 0. Extending to edge-colorings, one asks whether forbidding a fixed coloring of K_k in an s-edge coloring of K_n guarantees a large homogeneous set using at most s - 1 colors. A "
openaire   +1 more source

Designing transparent conductors using forbidden optical transitions

Matter, 2023
Matthew K Horton, Yihuang Xiong, Jimmy-Xuan Shen   +2 more
exaly  

Light-Induced Activation of Forbidden Exciton Transition in Strongly Confined Perovskite Quantum Dots

ACS Nano, 2018
Dong Hee Son, Hua Wang, Yitong Dong
exaly  

Forbidden subgraphs that imply 2-factors

Discrete Mathematics, 2008
R J Faudree
exaly  

A global optimal approach to facility location in the presence of forbidden regions

Computers and Industrial Engineering, 2003
Ronald Mcgarvey, Tom M Cavalier
exaly  

Effect of collisions on forbidden lines

Journal of Applied Physics, 1987
Cooper J
exaly  

Forbidden Vertices

Mathematics of Operations Research, 2015
, Gustavo Angulo, Santanu S Dey
exaly  

Ultranarrow, forbidden, singlet–triplet anticrossings in H2

Journal of Chemical Physics, 1975
Terry Miller, Freund Robert S, Miller Terry A   +2 more
exaly  

On the complexity of paths avoiding forbidden pairs

Discrete Applied Mathematics, 2009
Ondřej Pangrác, Petr Kolman
exaly  

Single machine unbounded parallel-batch scheduling with forbidden intervals

European Journal of Operational Research, 2008
Lingfa Lu, Jinjiang Yuan
exaly