Extremal problems for -partite and -colorable hypergraphs.
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Using Lovász local lemma in the space of random injections.”
Extremal problems for -partite and -colorable hypergraphs.
On a two-sided Turán problem.
Mubayi, Dhruv, Zhao, Yi (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A two-dimensional van Aardenne-Ehrenfest theorem in irregularities of distribution
József Beck (1989)
Compositio Mathematica
Similarity:
Note on linear arboricity of graphs with large girth
Filip Guldan (1991)
Czechoslovak Mathematical Journal
Similarity:
Bounding the partition function of spin-systems.
Galvin, David J. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The tau constant of a metrized graph and its behavior under graph operations.
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Turán density of the hypergraph .
Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Perfectly balanced partitions of smoothed graphs.
Ben-Eliezer, Ido, Krivelevich, Michael (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degree sequences of -free graphs.
Pikhurko, Oleg, Taraz, Anusch (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: