相关论文: Additive induced-hereditary properties and unique …
A graph is called uniquely distinguishing colorable if there is only one partition of vertices of the graph that forms distinguishing coloring with the smallest possible colors. In this paper, we study the unique colorability of the…
We prove a general factorization theorem for maps with hereditarily indecomposable fibers and apply it to reprove a theorem of Mackoviak on the existence of universal hereditarily indecomposable continua.
In this report, we describe a novel graph invariant for computational graphs (colored directed acylic graphs) and how we used it to generate all distinct computational graphs up to isomorphism for small graphs. The algorithm iteratively…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
This paper proves a conditional structural uniqueness theorem for induced weight on robust record sectors within an admissible Hilbert record layer. Its theorem target and additive carrier differ from those of the standard Born-rule routes:…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
An edge-colouring of a graph is distinguishing, if the only automorphism which preserves the colouring is the identity. It has been conjectured that all but finitely many connected, finite, regular graphs admit a distinguishing…
We prove that the bounded and bounded below derived categories of (all) modules over the dual numbers have strongly unique (dg) enhancements. To this end we relate those categories to the category of sequences of vector spaces, which allows…
A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
In breakthrough results, Saxton-Thomason and Balogh-Morris-Samotij developed powerful theories of hypergraph containers. In this paper, we explore some consequences of these theories. We use a simple container theorem of Saxton-Thomason and…
We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…
We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…
Many complex systems and datasets are characterized by multiway interactions of different categories, and can be modeled as edge-colored hypergraphs. We focus on clustering such datasets using the NP-hard edge-colored clustering problem,…
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
This is a note on three graph parameters motivated by the Euler-Poincare characteristic for simplicial complex. We show those three graph parameters of a given connected graph $G$ is greater than or equal to that of the complete graph with…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…