Displaying 161 – 180 of 252

Showing per page

On the total k-domination number of graphs

Adel P. Kazemi (2012)

Discussiones Mathematicae Graph Theory

Let k be a positive integer and let G = (V,E) be a simple graph. The k-tuple domination number γ × k ( G ) of G is the minimum cardinality of a k-tuple dominating set S, a set that for every vertex v ∈ V, | N G [ v ] S | k . Also the total k-domination number γ × k , t ( G ) of G is the minimum cardinality of a total k -dominating set S, a set that for every vertex v ∈ V, | N G ( v ) S | k . 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...

On universal graphs for hom-properties

Peter Mihók, Jozef Miškuf, Gabriel Semanišin (2009)

Discussiones Mathematicae Graph Theory

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...

One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three

Joanna Polcyn (2017)

Discussiones Mathematicae Graph Theory

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.

On-line Ramsey theory.

Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Packing of nonuniform hypergraphs - product and sum of sizes conditions

Paweł Naroski (2009)

Discussiones Mathematicae Graph Theory

Hypergraphs H , . . . , H N 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.

Parallelepipeds, nilpotent groups and Gowers norms

Bernard Host, Bryna Kra (2008)

Bulletin de la Société Mathématique de France

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 2 and 3 and show when this possible, and describe a correspondence between the parallelepiped structures and nilpotent groups.

Partial unconditionality of weakly null sequences.

Jordi López Abad, Stevo Todorcevic (2006)

RACSAM

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...

Planar Ramsey numbers

Izolda Gorgol (2005)

Discussiones Mathematicae Graph Theory

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.

Quasigroups arisen by right nuclear extension

Péter T. Nagy, Izabella Stuhl (2012)

Commentationes Mathematicae Universitatis Carolinae

The aim of this paper is to prove that a quasigroup Q with right unit is isomorphic to an f -extension of a right nuclear normal subgroup G by the factor quasigroup Q / G if and only if there exists a normalized left transversal Σ Q to G in Q such that the right translations by elements of Σ commute with all right translations by elements of the subgroup G . Moreover, a loop Q is isomorphic to an f -extension of a right nuclear normal subgroup G by a loop if and only if G is middle-nuclear, and there exists...

Currently displaying 161 – 180 of 252