Counterexamples for properties of line graphs of graphs of diameter two
Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
We prove that for any , there exists an infinite family of graphs such that for all and for all . These counterexamples to Hedetniemi’s conjecture show that the Boolean lattice of exponential graphs with as a base is infinite for .
Counting and selecting at random bipartite graphs with fixed degrees
Counting forests by descents and leaves.
Counting graphs with different numbers of spanning trees through the counting of prime partitions
Let be the set of all integers such that there exists a connected graph on vertices with precisely spanning trees. It was shown by Sedláček that...
Counting Lamé differential operators
Counting Maximal Distance-Independent Sets in Grid Graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied
Counting nondecreasing integer sequences that Lie below a barrier.
Counting non-isomorphic maximal independent sets of the -cycle graph.
Counting occurrences of 132 in an even permutation.
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Counting perfect matchings in polyominoes with an application to the dimer problem
Counting points of slope varieties over finite fields.
Counting rooted trees: the universal law .
Counting set covers and split graphs.
Counting triangulations of planar point sets.
Counting two-graphs related to trees.
Counting unlabelled topologies and transitive relations.
Counting unrooted maps using tree-decomposition.
Coûts moyens de circuits hamiltoniens de de