Results 151 to 160 of about 235,748 (327)
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source
Invariants of finite groups and their applications to combinatorics [PDF]
, 1979 Richard P. Stanley
openalex +1 more source
Vocal Learning Versus Speech Evolution: Untangling a False Equivalence
Ecology and Evolution, Volume 15, Issue 4, April 2025.ABSTRACT The evolution of speech remains one of the most profound and unresolved questions in science. Despite significant advancements in comparative research, key assumptions about the evolutionary precursors of speech continue to be accepted with minimal scrutiny.
Adriano R. Lameira
wiley +1 more source
Recent developments in algebraic combinatorics [PDF]
arXiv, 2002 A survey of three recent developments in algebraic combinatorics: (1) the Laurent phenomenon, (2) Gromov-Witten invariants and toric Schur functions, and (3) toric h-vectors and intersection cohomology. This paper is a continuation of "Recent progress in algebraic combinatorics" (math.CO/0010218), which dealt with three other topics.
arxiv
Invariants of Combinatorial Line Arrangements and Rybnikov's Example
, 2004 Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups.
Artal, E. +3 more
core
New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences
Journal of Combinatorial Designs, Volume 33, Issue 4, Page 156-171, April 2025.ABSTRACT In an array over an alphabet of v symbols, a t‐set of column indices { c 1 , … , c t } is covered if each t‐tuple of the alphabet occurs at least once as a row of the sub‐array indexed by c 1 , … , c t. A covering array, denoted by CA( N ; t , k , v ), is an N × k array over an alphabet with v symbols with the property that any t‐set of ...
Kianoosh Shokri, Lucia Moura
wiley +1 more source
Some asymptotic methods in combinatorics [PDF]
, 1979 J. M. Plotkin, John W. Rosenthal
openalex +1 more source
Combinatorics and geometry of Littlewood-Richardson cones [PDF]
arXiv, 2004 We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
arxiv
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes
Journal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley +1 more source
Combinatorics of Partial Sums with Applications to Limit Theorems [PDF]
, 1970 Hermann Dinges
openalex +1 more source