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. On the maximal number of certain subgraphs in $K_r$-free graphs
 
research article

On the maximal number of certain subgraphs in $K_r$-free graphs

Györi, Ervin
•
Pach, János  
•
Simmonovits, Miklós
1991
Graphs and Combinatorics
  • Details
  • Metrics
Type
research article
DOI
10.1007/BF01789461
Author(s)
Györi, Ervin
Pach, János  
Simmonovits, Miklós
Date Issued

1991

Published in
Graphs and Combinatorics
Volume

7

Issue

1

Start page

31

End page

37

Subjects

triangle-free graph

•

colour classes

Note

Professor Pach's number: [067]

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/31057
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