Skip to main content

Questions tagged [graph-theory]

A puzzle built around graphs: sets of nodes joined together by paths. Use with [mathematics]

4 votes
2 answers
177 views

This is a follow up question to my previous question: The Emperor’s Command: All Roads Lead to Rome, because our emperor wants more! The Emperor was pleased that all roads led to Rome, but his thirst ...
Oray's user avatar
  • 36.6k
11 votes
3 answers
627 views

This is follow-up question to All (red and blue) roads lead to Rome Eight cities lie in a kingdom, with Rome at the center of power. Every morning, the Emperor shouts a sequence of colors from his ...
Oray's user avatar
  • 36.6k
29 votes
4 answers
1k views

(This problem is from the 2024 Konhauser Problemfest, written by Stan Wagon.) Eleven cities, one of them being Rome, are arranged in a circle, with adjacent cities joined by a pair of one-way roads, ...
Misha Lavrov's user avatar
  • 2,766
5 votes
1 answer
458 views

The puzzle reads: Suppose you are a galactic engineer. You are building a communication network between many distinct star systems. To prevent signal interference, every single pair of stars must be ...
AshishMath's user avatar
19 votes
1 answer
531 views

Each vertex of a $n$-dimensional hypercube is a room with a whiteboard and $n$ buttons labeled $1$ to $n$. Each vertex is labeled with a binary string from $00\cdots0$ to $11\cdots 1$($n$ digits), and ...
Waterbottle3939's user avatar
18 votes
3 answers
981 views

Here's a problem I recently saw (not my own): In a group of 20 people, each person bears a grudge against exactly one other person in the group. No matter how these grudges are arranged (multiple ...
Prim3numbah's user avatar
5 votes
3 answers
890 views

Several straight lines drawn on a sheet of paper divide it into polygons. Each line crosses the entire sheet of paper, touching two of its edges. Is it always possible to color each polygon with one ...
Hemant Agarwal's user avatar
23 votes
2 answers
1k views

The following image depicts a small part of a vast "cube garden": This garden started as a single 1x1x1 cube, which was grown into the complex shape you see here by performing the following ...
plasticinsect's user avatar
18 votes
3 answers
2k views

Netwalk (and other names) is a puzzle game with randomly generated "networks" consisting of computers (nodes), a source node, and connectors (either a straight through pipe, a right-angled ...
Canadian Luke's user avatar
7 votes
4 answers
761 views

Consider the following graph (3 edges between A,B; 3 edges between B,C; 2 edges between A,C). How many trails are there that start from vertex A and end at vertex C? Two trails are considered the same ...
Lucenaposition's user avatar
7 votes
2 answers
627 views

I am trying to memorize the 143 three-digit primes. It would help if I could arrange them around a circle in which any two next to each other share at least two (not necessarily different) digits. For ...
Bernardo Recamán Santos's user avatar
15 votes
3 answers
2k views

Anita lives in a city with a peculiar road system: every road is a circle (not necessarily of the same radius). The rules of the system are simple: no sharp turns. That is, if you are at a transversal ...
Pranay's user avatar
  • 28.6k
11 votes
2 answers
834 views

Find a set of ten positive integers such that in any subset of five of them there is at least one number with a common divisor (not necessarily the same) with all the other four, and yet, among the ...
Bernardo Recamán Santos's user avatar
17 votes
7 answers
2k views

A problem proposed by Ashay Burungale of Satara, Maharashtra, India, in the November 2008 issue of American Mathematical Monthly: In a certain town of population 2n + 1, all relations are reciprocal: ...
Hemant Agarwal's user avatar
3 votes
1 answer
297 views

We have many puzzles to find complete knight's tours – including on 4D boards, irregular boards and nonplanar boards – but few puzzles to find partial tours where only some cells are visited. I ...
Parcly Taxel's user avatar
  • 10.5k

15 30 50 per page
1
2 3 4 5
18