Results 101 to 110 of about 11,687 (142)

Hypergraph coloring complexes.

Discrete Math, 2012
Breuer F, Dall A, Kubitzke M.
europepmc   +1 more source

Coinductive Counting: Bisimulation in Enumerative Combinatorics.

Electronic Notes in Theoretical Computer Science, 2002
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Lessons in Enumerative Combinatorics

Graduate Texts in Mathematics, 2021
1. Basic Combinatorial Structures.- 2. Partitions and Generating Functions.- 3. Planar Trees and the Lagrange Inversion Formula.- 4. Cayley Trees.- 5. The Cayley-Hamilton Theorem.- 6. Exponential Structures and Polynomial Operators.- 7. The Inclusion-Exclusion Principle.- 8. Graphs, Chromatic Polynomials and Acyclic Orientations.- 9.
Ömer Egecioglu, Adriano M Garsia
exaly   +2 more sources

Enumerative Combinatorics

1986
Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled ...
Richard P Stanley
exaly   +2 more sources

Enumerative combinatorics

ACM SIGACT News, 2008
Charalambos A Charalambides
exaly   +3 more sources

Enumerative Combinatorics

2016
Peter J Cameron
exaly   +2 more sources

Enumerative Combinatorics

Oberwolfach Reports, 2023
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
Mireille Bousquet-Mélou, Guillaume Chapuy, Michael Drmota, Sergi Elizalde   +3 more
openaire   +1 more source

4 Enumerative combinatorics

2021
exaly   +2 more sources

What Is Enumerative Combinatorics?

2011
Richard P Stanley
exaly   +2 more sources