In 1990 Bender, Canfield, and McKay gave an asymptotic formula for the number of connected graphs on
Given a graph
 NSFPAR ID:
 10367039
 Publisher / Repository:
 Wiley Blackwell (John Wiley & Sons)
 Date Published:
 Journal Name:
 Random Structures & Algorithms
 Volume:
 60
 Issue:
 4
 ISSN:
 10429832
 Page Range / eLocation ID:
 p. 594630
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract with m edges, whenever and . We give an asymptotic formula for the number of connected r‐uniform hypergraphs on with m edges, whenever is fixed and with , that is, the average degree tends to infinity. This complements recent results of Behrisch, Coja‐Oghlan, and Kang (the case ) and the present authors (the case , ie, “nullity” or “excess” o (n )). The proof is based on probabilistic methods, and in particular on a bivariate local limit theorem for the number of vertices and edges in the largest component of a certain random hypergraph. The arguments are much simpler than in the sparse case; in particular, we can use “smoothing” techniques to directly prove the local limit theorem, without needing to first prove a central limit theorem. 
Abstract It is proved that for every countable structure
and a computable successor ordinal α there is a countable structure which is ‐least among all countable structures such that is Σ‐definable in the αth jump . We also show that this result does not hold for the limit ordinal . Moreover, we prove that there is no countable structure with the degree spectrum for . 
Abstract A graph
G is said to be 2‐divisible if for all (nonempty) induced subgraphsH ofG ,can be partitioned into two sets such that and . (Here denotes the clique number of G , the number of vertices in a largest clique ofG ). A graphG is said to be perfectly divisible if for all induced subgraphsH ofG ,can be partitioned into two sets such that is perfect and . We prove that if a graph is ‐free, then it is 2‐divisible. We also prove that if a graph is bull‐free and either odd‐hole‐free or P _{5}‐free, then it is perfectly divisible. 
Abstract Let
be integers with , and set . Erdős proved that when , each n ‐vertex nonhamiltonian graphG with minimum degreehas at most edges. He also provides a sharpness example for all such pairs . Previously, we showed a stability version of this result: for n large enough, every nonhamiltonian graphG onn vertices withand more than edges is a subgraph of . In this article, we show that not only does the graph maximize the number of edges among nonhamiltonian graphs with n vertices and minimum degree at leastd , but in fact it maximizes the number of copies of any fixed graphF whenn is sufficiently large in comparison withd and. We also show a stronger stability theorem, that is, we classify all nonhamiltonian n ‐vertex graphs withand more than edges. We show this by proving a more general theorem: we describe all such graphs with more than copies of for any k . 
Abstract If
G is a graph andis a set of subgraphs of G , then an edge‐coloring ofG is called‐polychromatic if every graph from gets all colors present in G . The‐polychromatic number of G , denoted, is the largest number of colors such that G has an‐polychromatic coloring. In this article, is determined exactly when G is a complete graph andis the family of all 1‐factors. In addition is found up to an additive constant term when G is a complete graph andis the family of all 2‐factors, or the family of all Hamiltonian cycles.