A limit theorem for the six-length of random functional graphs with a fixed degree sequence

zbMath1428.05283arXiv1803.02667MaRDI QIDQ2278111

Kevin Leckey, Nicholas C. Wormald

Publication date: 9 December 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.02667

File on IPFS

zbMATH Keywords

algorithms for integer factorisation

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Functional graphs of polynomials over finite fields
• Random mappings with constraints on coalescence and number of origins
• On the heuristic of approximating polynomials over finite fields by random mappings
• Predecessors and Successors in Random Mappings with Exchangeable In-Degrees
• Random mappings with exchangeable in-degrees
• Factorization of the Eighth Fermat Number
• A monte carlo method for factorization
• Probability Distributions Related to Random Mappings

This page was built for publication: A limit theorem for the six-length of random functional graphs with a fixed degree sequence