"Matchings with few colors in colored complete graphs and hypergraphs."

András Gyárfás, Gábor N. Sárközy (2020)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2020.111831

access: open

type: Journal Article

metadata version: 2021-05-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/GyarfasS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/GyarfasS20
András Gyárfás, Gábor N. Sárközy:
Matchings with few colors in colored complete graphs and hypergraphs. Discret. Math. 343(5): 111831 (2020)

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.