Skip to main content
Log in

Asymmetric trees with two prescribed degrees

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. L. Babai, Representation of permutation groups by graphs,Combinatorial theory and its appl. Balatonfüred 1969 (P. Erdős et al. eds.) North-Holland (Amsterdam, 1970), 55–80.

    Google Scholar 

  2. L. Babai andL. Lovász, Permutation groups and almost regular graphs,Studia Sci. Math. Hung.,8 (1973), 141–150.

    Google Scholar 

  3. V. Chvátal, P. Hell, L. Kučera andJ. Nešetříl, Every finite graph is a full subgraph of a rigid graph,J. Comb. Theory,11 (1971),. 284–286.

    Google Scholar 

  4. R. Frucht, Herstellung von Graphen mit vorgegebener abstrakter Gruppe,Compositio Math.,6 (1938), 239–250.

    Google Scholar 

  5. R. Frucht, Graphs of degree 3 with a given abstract group,Canad. J. Math.,1 (1949), 365–378.

    Google Scholar 

  6. J. de Groot, Groups represented by homeomorphism groups I,Math. Annalen,138 (1959), 80–102.

    Google Scholar 

  7. Z. Hedrlin andJ. Lambek, How comprehensive is the category of semigroups?J. of Algebra,11 (1969), 195–212.

    Google Scholar 

  8. Z. Hedrlin andE. Mendelsohn, The category of graphs with a given subgraph — with applications to topology and algebra,Canad. J. Math. 21 (1969), 1506–1517.

    Google Scholar 

  9. Z. Hedrlin andA. Pultr, Symmetric relations (undirected graphs) with given semigroups,Monatshefte Math.,69 (1965), 318–322.

    Google Scholar 

  10. Z. Hedrlin andA. Pultr, On rigid undirected graphs,Canad. J. Math.,18 (1966), 1237–1242.

    Google Scholar 

  11. P. Hell andJ. Nešetřil, Graphs andk-societies,Canad. Math. Bull.,13 (1970), 375–381.

    Google Scholar 

  12. E. Mendelsohn, On a technique for representing semigroups as endomorphism semigroups of graphs with given properties,Semigroup Forum,4 (1972), 283–294.

    Google Scholar 

  13. G. Sabidussi, Graphs with given automorphism group, and given graph theoretical properties,Canad. J. Math.,9 (1957), 515–525.

    Google Scholar 

  14. G. Sabidussi, Graphs with given infinite group.Monatsh. Math.,64 (1960), 446–457.

    Google Scholar 

  15. P. Vopenka, A. Pultr andZ. Hedrlin, A rigid relation exists on any set,Comment. Math. Univ. Carolinae,6 (1965), 149–155.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babai, L. Asymmetric trees with two prescribed degrees. Acta Mathematica Academiae Scientiarum Hungaricae 29, 193–200 (1977). https://doi.org/10.1007/BF01896481

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01896481

Keywords

Navigation