A logical expansion in mathematics

DOI10.1090/S0002-9904-1932-05460-XzbMath0005.14602WikidataQ93608508 ScholiaQ93608508MaRDI QIDQ4482723

No author found.

Publication date: 1932

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

foundations, philosophy, logic

Related Items (44)

The Broken-Circuit Complex ⋮ Increasing spanning forests in graphs and simplicial complexes ⋮ The topology of the external activity complex of a matroid ⋮ A broken circuit model for chromatic homology theories ⋮ Non-broken circuits of reflection groups and factorization in \(D_ n\) ⋮ A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs ⋮ Generalised chromatic polynomials of graphs from heaps of pieces ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ Evaluations of Tutte polynomials of regular graphs ⋮ Lagrangian geometry of matroids ⋮ Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ A Gröbner basis for the graph of the reciprocal plane ⋮ The cycle polynomial of a permutation group ⋮ Linear bounds on characteristic polynomials of matroids ⋮ A Hodge decomposition interpretation for the coefficients of the chromatic polynomial ⋮ Potts model and graph theory. ⋮ Symmetric functions in noncommuting variables ⋮ Nowhere-harmonic colorings of graphs ⋮ Asymptotic behavior of spanning forests and connected spanning subgraphs on two-dimensional lattices ⋮ A Combinatorial Model for Series-Parallel Networks ⋮ Irregularity indices for line graph of Dutch windmill graph ⋮ The Chromatic Polynomial of the Truncated Icosahedron ⋮ GlobaL analysis of the deiete-contract recursion for graphs and matroids ⋮ Maximizing H‐Colorings of a Regular Graph ⋮ On the Broken-Circuit Complex of Graphs ⋮ A broken cycle theorem for the restrained chromatic function ⋮ A survey of some network reliability analysis and synthesis results ⋮ A note on a broken-cycle theorem for hypergraphs ⋮ Counting independent sets in graphs of hyperplane arrangements ⋮ Chromatic symmetric function of graphs from Borcherds algebras ⋮ Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions ⋮ On the computational complexity of the Jones and Tutte polynomials ⋮ Linked-cluster expansion of the graph-vertex coloration problem ⋮ On the homogenized linial arrangement: intersection lattice and Genocchi numbers ⋮ The inclusion-exclusion principle ⋮ Flow polynomials of a signed graph ⋮ Monomial bases for broken circuit complexes ⋮ Chromatic polynomials and logarithmic concavity ⋮ Some Alternate Characterizations of Reliability Domination ⋮ Characteristic vertices of trees^* ⋮ Characteristic vertices of trees^* ⋮ On a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomials ⋮ Chromatic polynomials and broken cycles ⋮ Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)

This page was built for publication: A logical expansion in mathematics