"Graphs Without Large Complete Minors Are Quasi-Random."

Joseph Samuel Myers (2002)

> Home

Details and statistics

DOI: 10.1017/S096354830200531X

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/Myers02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/Myers02
Joseph Samuel Myers:
Graphs Without Large Complete Minors Are Quasi-Random. Comb. Probab. Comput. 11(6): 571-585 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.