On a probabilistic method in graph theory

DOI10.1016/0095-8956(81)90036-8zbMath0493.05051OpenAlexW1977911407MaRDI QIDQ1168339

D. G. Hoffman, Donald L. Greenwell

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90036-8

zbMATH Keywords

edge-transitive graphsnumber of edgessubgraphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Probability theory on algebraic and topological structures (60B99)

Related Items (1)

On several symmetry conditions for graphs

Cites Work

• Unnamed Item

This page was built for publication: On a probabilistic method in graph theory