How to make a random graph irregular

DOI10.1002/rsa.3240060219zbMath0821.05050OpenAlexW2125314709MaRDI QIDQ4697822

Zsolt Tuza

Publication date: 12 September 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060219

zbMATH Keywords

random graphedge probabilityweight assignmenttriangle packingsirregular edge labeling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

The irregularity strength and cost of the union of cliques ⋮ A generalization of Faudree–Lehel conjecture holds almost surely for random graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: How to make a random graph irregular