On a probabilistic method in graph theory

DOI10.1016/0095-8956(81)90036-8zbMath0493.05051MaRDI 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 graphs; number of edges; subgraphs

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C75: Structural characterization of families of graphs

60B99: Probability theory on algebraic and topological structures

Related Items

On several symmetry conditions for graphs

Cites Work

• Unnamed Item