# Number of 1-factorizations of regular high-degree graphs

@inproceedings{2018NumberO1, title={Number of 1-factorizations of regular high-degree graphs}, author={}, year={2018} }

- Published 2018

A 1-factor in an n-vertex graph G is a collection n 2 vertex-disjoint edges and a 1-factorization of G is a partition of its edges into edge-disjoint 1-factors. Clearly, a 1-factorization of G cannot exist unless n is even and G is regular (that is, all vertices are of the same degree). The problem of finding 1-factorizations in graphs goes back to a paper of Kirkman in 1847 and has been extensively studied since then. Deciding whether a graph has 1-factorization is usually a very difficult… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

## 1-Factorizations of Pseudorandom Graphs

View 7 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 20 references

## Probability inequalities for sums of bounded random variables

View 4 Excerpts

Highly Influenced

## Proof of the 1-Factorization and Hamilton Decomposition Conjectures

View 3 Excerpts

Highly Influenced

## Edge coloring regular graphs of high degree

View 2 Excerpts

Highly Influenced

## Parallelisms of Complete Designs

View 3 Excerpts

Highly Influenced

## Two-Sided

View 1 Excerpt

## Steiner triple systems have perfect matchings, arXiv preprint arXiv:1611.02246

View 1 Excerpt

## Counting and packing Hamilton `-cycles in dense hypergraphs

View 2 Excerpts

## An upper bound on the number of Steiner triple systems

View 2 Excerpts

## A THEOREM ON FLOWS IN NETWORKS

View 1 Excerpt