Results 141 to 150 of about 46,626 (239)
Journal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
, 2010 A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Sami H. Assaf, Assaf, Sami H.
core
Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large‐deviation principle with logarithmic speed: the rare event that the largest component contains linearly more vertices ...
Joost Jorritsma, Bert Zwart
wiley +1 more source
Angewandte Chemie, Volume 138, Issue 26, 22 June 2026.Pareto optimal compositions of alloy catalyst for oxygen reduction reaction are uncovered through multi‐objective Bayesian optimization of activity, stability, and material cost in an eight‐element high‐entropy alloy composition space. The substantial Pareto front obtained is compared to experimental literature and analyzed to elucidate the roles and ...
Mads K. Plenge +4 more
wiley +2 more sources
Discrete Mathematics, 2002 This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.
openaire +2 more sources
Structure and Randomness in Combinatorics [PDF]
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007 13 pages, no figures. FOCS 2007 tutorial notes.
openaire +3 more sources
The homotopy type of the polyhedral product for shifted complexes [PDF]
, 2013 We prove a conjecture of Bahri, Bendersky, Cohen and Gitler: if K is a shifted simplicial complex on n vertices,X1,...,Xn are pointed connected CW-complexes and CXi is the cone on Xi, then the polyhedral product determined by K and the pairs (C Xi , Xi )
Theriault, Stephen, Grbić, Jelena
core +1 more source
Is It Easier to Count Communities Than Find Them?
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: Might it be possible to infer properties of the community
Cynthia Rush +3 more
wiley +1 more source
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
Algorithmic complexity of protein identification: combinatorics of weighted strings
, 2004 Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna +9 more
core +1 more source