As an undergraduate at the University of Chile, Bernardo Subercaseaux took a dim view of using computers to do math. It seemed antithetical to real intellectual discovery. “There’s some instinct or ...

This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

For years, a simple question has haunted Máté Matolcsi, a professor at the Budapest University of Technology and Economics. How much of an infinite plane can you color in while making sure that no two ...

As an undergraduate at the University of Chile, Bernardo Subercaseaux took a dim view of using computers to do math. It seemed antithetical to real intellectual discovery. “There’s some instinct or ...

Thousands of notoriously difficult problems in computer science are actually the same problem in disguise If you're enjoying this article, consider supporting our award-winning journalism by ...