The Ramsey number of diamond-matchings and loose cycles in hypergraphs.

Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre

The search session has expired. Please query the service again.

Displaying similar documents to “The Ramsey number of diamond-matchings and loose cycles in hypergraphs.”

Rainbow $H$ -factors of complete $s$ -uniform $r$ -partite hypergraphs.

Chen, Ailian, Zhang, Fuji, Li, Hao (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On chromatic and achromatic numbers of uniform hypergraphs

Ernest Jucovič, František Olejník (1974)

Časopis pro pěstování matematiky

Similarity:

Partitioning 3-colored complete graphs into three monochromatic cycles.

Gyárfás, András, Ruszinkó, Miklós, Sarközy, Gábor N., Szemerédi, Endre (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A decomposition of gallai multigraphs

Alexander Halperin, Colton Magnant, Kyle Pula (2014)

Discussiones Mathematicae Graph Theory

Similarity:

An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. We then use this structure to prove Ramsey-type results within Gallai colorings. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decomposition into directed...

Hypergraphs with large transversal number and with edge sizes at least four

Michael Henning, Christian Löwenstein (2012)

Open Mathematics

Similarity:

Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we...

Vertex-distinguishing edge-colorings of linear forests

Sylwia Cichacz, Jakub Przybyło (2010)

Discussiones Mathematicae Graph Theory

Similarity:

In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) - the irregular coloring number, and hence verify the conjecture when G is a vertex-disjoint union of paths. We also investigate the point-distinguishing chromatic index, χ₀(G), where sets, instead of multisets, are required to be distinct,...

Short certificates for tournaments.

Alon, Noga, Ruszinkó, Miklós (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the Vertex Folkman Numbers Fv(2,...,2;q)

Nenov, Nedyalko (2009)

Serdica Mathematical Journal

Similarity:

2000 Mathematics Subject Classification: 05C55. In this paper we shall compute the Folkman numbers ... We prove also new bounds for some vertex and edge Folkman numbers.

A note on embedding hypertrees.

Loh, Po-Shen (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A Note on Neighbor Expanded Sum Distinguishing Index

Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Woźniak (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices.

A note on graph coloring extensions and list-colorings.

Axenovich, Maria (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Rainbow $H$ -factors.

Yuster, Raphael (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity: