Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Note on generating all subsets of a finite set with disjoint unions.”
Edit distance and its computation.
Holes in graphs.
Peng, Yuejian, Rödl, Vojtech, Ruciński, Andrzej (2002)
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:
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:
Using Lovász local lemma in the space of random injections.
Lu, Linyuan, Székely, László (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Guessing secrets.
Chung, Fan, Graham, Ronald, Leighton, Tom (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a two-sided Turán problem.
Mubayi, Dhruv, Zhao, Yi (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremal problems for -partite and -colorable hypergraphs.
Mubayi, Dhruv, Talbot, John (2008)
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:
Uniform edge distribution in hypergraphs is hereditary.
Mubayi, Dhruv, Rödl, Vojtěch (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some problems in combinatorial set theory.
Erdős, Paul (1995)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Tomoki Nakamigawa (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to each other and they are isomorphic to one of four graphs: (1) a clique of order k, (2) an independent set of order k, (3) the join of a clique of order ℓ and an independent set of order k − ℓ, or (4) the union of an independent set of...
The sum of degrees in cliques.
Bollobás, Béla, Nikiforov, Vladimir (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: