What's up in

# combinatorics

## Latest Articles

### Computer Scientists Attempt to Corner the Collatz Conjecture

A powerful technique called SAT solving could work on the notorious Collatz conjecture. But it’s a long shot.

### Computer Search Settles 90-Year-Old Math Problem

By translating Keller’s conjecture into a computer-friendly search for a type of graph, researchers have finally resolved a problem about covering spaces with tiles.

### Landmark Math Proof Clears Hurdle in Top Erdős Conjecture

Two mathematicians have proved the first leg of Paul Erdős’ all-time favorite problem about number patterns.

### ‘Rainbows’ Are a Mathematician’s Best Friend

“Rainbow colorings” recently led to a new proof. It’s not the first time they’ve come in handy.

### Rainbow Proof Shows Graphs Have Uniform Parts

Mathematicians have proved that copies of smaller graphs can always be used to perfectly cover larger ones.

### Mathematicians Begin to Tame Wild ‘Sunflower’ Problem

A major advance toward solving the 60-year-old sunflower conjecture is shedding light on how order begins to appear as random systems grow in size.

### Color Me Polynomial

Polynomials aren’t just exercises in abstraction. They’re good at illuminating structure in surprising places.

### Decades-Old Computer Science Conjecture Solved in Two Pages

The “sensitivity” conjecture stumped many top computer scientists, yet the new proof is so simple that one researcher summed it up in a single tweet.

### A 53-Year-Old Network Coloring Conjecture Is Disproved

In just three pages, a Russian mathematician has presented a better way to color certain types of networks than many experts thought possible.