Annals of Combinatorics
Publisher: Springer Nature · ISSN 0218-0006,0219-3094 · 139 articles
-
On d-Distance p-Packing Domination Number in Strong Products
Abstract The d -distance p -packing domination number $$\gamma _d^p(G)$$ γ d p ( G ) of a graph G is the cardinality of a smallest set of vertices of G which is both a d -distance dominating set and a p -packing. If no such set exists,...
- On q-Deformed Markov Numbers: Cohn Matrices and Perfect Matchings with Weighted Edges
-
Lattice Point Enumeration of Polytopes Associated to Integer Compositions
Abstract An n -dimensional lattice polytope $${\mathcal {Q}}_\sigma $$ Q σ can be associated to any composition $$\sigma $$ σ of a positive integer n , as a special case of constructions due to Pitman–Stanley and Chapoton. The entries...
- Coalescence Probabilities of Cycle Products
-
Counting Subgraphs of Coloring Graphs Using Shadow Graphs
Abstract Given a graph G , the k -coloring graph $$\mathcal {C}_k(G)$$ C k ( G ) is constructed by selecting proper k -colorings of G as vertices, with an edge between two colorings if they differ in the color of exactly one vertex. The...
- Some Properties of the Redei–Berge Function and Related Combinatorial Hopf Algebras
- Joint Equidistributions of Mesh Patterns 123 and 321 with Symmetric and Minus-Antipodal Shadings
- A Polynomial Bosonic Form of Statistical Configuration Sums and the Odd/Even Minimal Excludant in Integer Partitions
-
Counting Pattern-Avoiding Permutations by Big Descents
Abstract A descent k of a permutation $$\pi =\pi _{1}\pi _{2}\cdots \pi _{n}$$ π = π 1 π 2 ⋯ π n is called a big descent if $$\pi _{k}>\pi _{k+1}+1$$ π k > π k + 1 + 1 ; denote the number of big descents of $$\pi $$ π by...
- Labeled Trees Generating Separable and Locally Finite Ultrametrics
- The Basis Number of 1-Planar Graphs
- A Counterexample to the Order Relation Between Largest Common Subtree and Smallest Common Supertree
-
Edge Isoperimetry of Lattices
Abstract We present two results related to an edge isoperimetric question for Cayley graphs on the integer lattice asked by Barber and Erde (Discrete Anal Paper no. 7:16, 2018). For any (undirected) graph G , the edge boundary of a...
- A Lower Bound on Forcing Numbers Based on Height Functions
- Hydra Graphs for Graph LP Algebras
- The Multiplicity of Eigenvalues of $$A_{\alpha }$$ of Trees
- On Integer Partitions with a Fixed Overlined Smallest Part
- Embeddings of Edge-Colored Dual Graphs of Balanced 3- and 4-Manifolds
- Jones’ Conjecture for Halin Graphs and a Bit More
- A Disproof of Two Conjectures on Stack-Sorting Maps for Words
- Overpartitions and Kaur, Rana, and Eyyunni’s Mex Sequences
- Recursions for Multi-Component Extensions of the q-Dyson Constant Term Identity
- Sign Patterns of Certain Infinite Products
- Overpartitions with Separated Overlined Parts and Non-overlined Parts
-
Extremal Totally Regular Mixed Graphs and Partially Oriented Incidence Graphs of Projective and Biaffine Planes
Abstract An ( r , z ; g )-mixed graph is a graph containing both edges and darts satisfying the regularity property that each vertex of the graph is incident to r edges, z ingoing and z outgoing darts (called total regularity), and...
- Spectral Analysis of Normalized Hermitian Laplacian Matrices in Random Mixed Graphs
- On Paths with Three Blocks of the Form P(1, k, 1) in Digraphs
- Power Sum Expansions for Kromatic Symmetric Functions Using Lyndon Heaps
-
On the Asymptotics of Certain Colored Partitions
Abstract We will prove an infinite family of asymptotic formulas for the logarithm of certain two-colored partitions. An infinite sub-family of these asymptotics was posed as a conjecture by Guadalupe.
- Enumeration of Max-Pooling Responses with Generalized Permutohedra