Bounding the partition function of spin-systems.

Galvin, David J.

Displaying similar documents to “Bounding the partition function of spin-systems.”

Degree sequences of $F$ -free graphs.

Pikhurko, Oleg, Taraz, Anusch (2005)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Note on linear arboricity of graphs with large girth

Filip Guldan (1991)

Czechoslovak Mathematical Journal

Similarity:

Edit distance and its computation.

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

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The sum of degrees in cliques.

Bollobás, Béla, Nikiforov, Vladimir (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:

Upper and lower bounds for $F_{v} (4, 4; 5)$ .

Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)

The Electronic Journal of Combinatorics [electronic only]

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

On Maximum Weight of a Bipartite Graph of Given Order and Size

Mirko Horňák, Stanislav Jendrol’, Ingo Schiermeyer (2013)

Discussiones Mathematicae Graph Theory

Similarity:

The weight of an edge xy of a graph is defined to be the sum of degrees of the vertices x and y. The weight of a graph G is the minimum of weights of edges of G. More than twenty years ago Erd˝os was interested in finding the maximum weight of a graph with n vertices and m edges. This paper presents a complete solution of a modification of the above problem in which a graph is required to be bipartite. It is shown that there is a function w*(n,m) such that the optimum weight is either...

On graphs with prescribed subgraphs of order $k$ , and a theorem of Kelly and Merriell

Yair Caro (1994)

Czechoslovak Mathematical Journal

Similarity: