Results 91 to 100 of about 70,151 (171)
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
, 2004 In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as game theory ...
Banderier, Cyril +2 more
core +1 more source
Embedding large subgraphs into dense graphs
, 2009 What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core +1 more source
A uniform model for Kirillov-Reshetikhin crystals. Extended abstract
, 2012 We present a uniform construction of tensor products of one-column Kirillov-Reshetikhin (KR) crystals in all untwisted affine types, which uses a generalization of the Lakshmibai-Seshadri paths (in the theory of the Littelmann path model).
Lenart, Cristian +4 more
core
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Quantum higher-order Fourier analysis and the Clifford hierarchy. [PDF]
Proc Natl Acad Sci U S ABu K, Gu W, Jaffe A.
europepmc +1 more source
A constructive method to determine the total vertex irregularity strength of two flower graph variants. [PDF]
MethodsXHinding N +6 more
europepmc +1 more source
Counting Rankings of Tree-Child Networks. [PDF]
Bull Math BiolZhang Q, Steel M.
europepmc +1 more source
Deep learning in biology faces a transferability crisis. [PDF]
PLoS BiolO'Shea-Wheller TA, Murray KI.
europepmc +1 more source
A study on q-analogue of generalized Motzkin sequence spaces, their matrix transformations and compact operators. [PDF]
PLoS OneQuan JJ, Narrania D, Raj K, Cai QB.
europepmc +1 more source