default search action

combined dblp search
author search
venue search
publication search

ask others

Journal of Combinatorial Theory, Series A, Volume 149

> Home > Journals > Journal of Combinatorial Theory, Series A

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 149, July 2017

- view
  authority control:
- export record
  dblp key:
  - journals/jct/Lunardon17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Lunardon17
Guglielmo Lunardon:
MRD-codes and linear sets. 1-20
- view
  authority control:
- export record
  dblp key:
  - journals/jct/Diaz-LopezHIO17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Diaz-LopezHIO17
Alexander Diaz-Lopez, Pamela E. Harris, Erik Insko, Mohamed Omar:
A proof of the peak polynomial positivity conjecture. 21-29
- view
  authority control:
- export record
  dblp key:
  - journals/jct/AllenBCM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/AllenBCM17
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft:
Tight cycles and regular slices in dense hypergraphs. 30-100
- view
  authority control:
- export record
  dblp key:
  - journals/jct/Lupini17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Lupini17
Martino Lupini:
Gowers' Ramsey Theorem for generalized tetris operations. 101-114
- view
  authority control:
- export record
  dblp key:
  - journals/jct/HanZZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/HanZZ17
Jie Han, Chuanyun Zang, Yi Zhao:
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. 115-147

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.