Uniform edge distribution in hypergraphs is hereditary.

Mubayi, Dhruv; Rödl, Vojtěch

Displaying similar documents to “Uniform edge distribution in hypergraphs is hereditary.”

Edit distance and its computation.

Balogh, József, Martin, Ryan (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Extremal problems for $t$ -partite and $t$ -colorable hypergraphs.

Mubayi, Dhruv, Talbot, John (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on neighbour-distinguishing regular graphs total-weighting.

Przybylo, Jakub (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Irregularity strength of regular graphs.

Przybylo, Jakub (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Turán density of the hypergraph ${a b c, a d e, b d e, c d e}$ .

Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bounding the partition function of spin-systems.

Galvin, David J. (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Decompositions of graphs into 5-cycles and other small graphs.

Sousa, Teresa (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Equitable hypergraph orientations.

Caro, Yair, West, Douglas, Yuster, Raphael (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

$H$ -free graphs of large minimum degree.

Alon, Noga, Sudakov, Benny (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on the Size-Ramsey number of long subdivisions of graphs

Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Let $T_{s} H$ be the graph obtained from a given graph $H$ by subdividing each edge $s$ times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in Proc. of the 13th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) 321–328], we prove that, for any graph $H$ , there exist graphs $G$ with $O (s)$ edges that are Ramsey with respect to $T_{s} H$ .

Degree sequences of $F$ -free graphs.

Pikhurko, Oleg, Taraz, Anusch (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity: