3.6k citations
- Perimeter InstituteCA147 papers
- Massachusetts Institute of TechnologyUS31 papers
- Centre National de la Recherche ScientifiqueFR28 papers
- Durham UniversityGB27 papers
- University of TorontoCA26 papers
- California Institute of TechnologyUS25 papers
- Stanford UniversityUS24 papers
- University of British ColumbiaCA24 papers
- Canadian Institute for Advanced ResearchCA23 papers
- McMaster UniversityCA19 papers
- Harvard UniversityUS18 papers
- National University of SingaporeSG17 papers
5 papers · 2 filters
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3
This paper proves that if is a graph (parallel edges allowed) of maximum degree 3, then provided that does not contain or as a subgraph, whe…
Fourier analysis and large independent sets in powers of complete graphs
Mahya Ghandehari, Hamed Hatami
For constant and arbitrary , it was known that in the graph any independent set of size close to the maximum is close to some independent set of maximum size. We pro…
On the context-freeness of the set of words containing overlaps
Narad Rampersad
We show that the set of binary words containing overlaps is not unambiguously context-free and that the set of ternary words containing overlaps is not context-free. We also show t…
Words avoiding repetitions in arithmetic progressions
Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit +1
Carpi constructed an infinite word over a 4-letter alphabet that avoids squares in all subsequences indexed by arithmetic progressions of odd difference. We show a connection betwe…
The Minor Crossing Number of Graphs with an Excluded Minor
Drago Bokal, Gašper Fijavž, David R. Wood
The "minor crossing number" of a graph is the minimum crossing number of a graph that contains as a minor. It is proved that for every graph there is a constant , su…