Inequalities Involving Maps of Finite Sets.
Inequalities of Bonferroni-Galambos type with applications to the Tutte polynomial and the chromatic polynomial.
Inequalities related to rearrangements of powers and symmetric polynomials.
Inequality of two critical probabilities for percolation.
Inequivalent Regular Factors of Regular Graphs on 8 Vertices
Inertia sets for graphs on six or fewer vertices.
Inertially arbitrary nonzero patterns of order 4.
Infinite directed paths in locally finite digraphs
Infinite families of divisibility properties modulo 4 for non-squashing partitions into distinct parts.
Infinite families of tight regular tournaments
In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3-dichromatic tight tournaments. With this family we positively answer to one case of a conjecture posed by V. Neumann-Lara. Finally, we show that any tournament with a tight mold is also tight.
Infinite locally finite hypohamiltonian graphs.
Infinite paths and cliques in random graphs
We study the thresholds for the emergence of various properties in random subgraphs of (ℕ, <). In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory.
Infinite paths in locally finite graphs and in their spanning trees
The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs.
Infinite precise objects
Infinite products over hyperpyramid lattices.
Infinite products over visible lattice points.
Infinite tree algebras
Infinitely many hypermaps of a given type and genus.
Inflationary tilings with a similarity structure.
Information flows, graphs and their guessing numbers.