Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Universal elements and the complexity of certain classes of infinite graphs
 
research article

Universal elements and the complexity of certain classes of infinite graphs

Komjáth, Péter
•
Pach, János  
1991
Discrete Mathematics
  • Details
  • Metrics
Type
research article
DOI
10.1016/0012-365X(91)90340-8
Author(s)
Komjáth, Péter
Pach, János  
Date Issued

1991

Publisher

Elsevier

Published in
Discrete Mathematics
Volume

95

Issue

1-3

Start page

255

End page

270

Subjects

induced subgraph

•

universal element

•

isometric embeddings

•

random graphs

•

hypergraphs

Note

Professor Pach's number: [076]

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
DCG  
Available on Infoscience
November 14, 2008
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/31058
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés