On the locality of the Prüfer code.
Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number of G is the minimum cardinality of a k-tuple dominating set S, a set that for every vertex v ∈ V, . Also the total k-domination number of G is the minimum cardinality of a total k -dominating set S, a set that for every vertex v ∈ V, . The k-transversal number τₖ(H) of a hypergraph H is the minimum size of a subset S ⊆ V(H) such that |S ∩e | ≥ k for every edge e ∈ E(H). We know that for any graph...
A graph property is any isomorphism closed class of simple graphs. For a simple finite graph H, let → H denote the class of all simple countable graphs that admit homomorphisms to H, such classes of graphs are called hom-properties. Given a graph property 𝓟, a graph G ∈ 𝓟 is universal in 𝓟 if each member of 𝓟 is isomorphic to an induced subgraph of G. In particular, we consider universal graphs in → H and we give a new proof of the existence of a universal graph in → H, for any finite graph...
Let P denote a 3-uniform hypergraph consisting of 7 vertices a, b, c, d, e, f, g and 3 edges {a, b, c}, {c, d, e}, and {e, f, g}. It is known that the r-color Ramsey number for P is R(P; r) = r + 6 for r ≤ 9. The proof of this result relies on a careful analysis of the Turán numbers for P. In this paper, we refine this analysis further and compute the fifth order Turán number for P, for all n. Using this number for n = 16, we confirm the formula R(P; 10) = 16.
Hypergraphs of order n are mutually packable if one can find their edge disjoint copies in the complete hypergraph of order n. We prove that two hypergraphs are mutually packable if the product of their sizes satisfies some upper bound. Moreover we show that an arbitrary set of the hypergraphs is mutually packable if the sum of their sizes is sufficiently small.
In his proof of Szemerédi’s Theorem, Gowers introduced certain norms that are defined on a parallelepiped structure. A natural question is on which sets a parallelepiped structure (and thus a Gowers norm) can be defined. We focus on dimensions and and show when this possible, and describe a correspondence between the parallelepiped structures and nilpotent groups.
We survey a combinatorial framework for studying subsequences of a given sequence in a Banach space, with particular emphasis on weakly-null sequences. We base our presentation on the crucial notion of barrier introduced long time ago by Nash-Williams. In fact, one of the purposes of this survey is to isolate the importance of studying mappings defined on barriers as a crucial step towards solving a given problem that involves sequences in Banach spaces. We focus our study on various forms of ?partial...
The planar Ramsey number PR(G,H) is defined as the smallest integer n for which any 2-colouring of edges of Kₙ with red and blue, where red edges induce a planar graph, leads to either a red copy of G, or a blue H. In this note we study the weak induced version of the planar Ramsey number in the case when the second graph is complete.
The aim of this paper is to prove that a quasigroup with right unit is isomorphic to an -extension of a right nuclear normal subgroup by the factor quasigroup if and only if there exists a normalized left transversal to in such that the right translations by elements of commute with all right translations by elements of the subgroup . Moreover, a loop is isomorphic to an -extension of a right nuclear normal subgroup by a loop if and only if is middle-nuclear, and there exists...
We characterize those classes 𝓒 of separable Banach spaces for which there exists a separable Banach space Y not containing ℓ₁ and such that every space in the class 𝓒 is a quotient of Y.