Question

Maximum number of students such that they all have at least 3 out of 6 different answers.

score 161 · Answer 1 · 2026-04-16 07:05:55

161

Views

Maximum number of students such that they all have at least 3 out of 6 different answers.

Published on 16 Apr 2026 - 7:05

score 84 · Answer 2 · 2026-04-15 01:33:04

84

Views

Finding a cycle in a 3-partite graph

Published on 15 Apr 2026 - 1:33

score 89 · Answer 3 · 2026-04-15 18:20:47

89

Views

Let G be connected simple graph, where all the vertices have even degree. Prove the following formula.

Published on 15 Apr 2026 - 18:20

score 746 · Answer 4 · 2026-05-11 02:55:28

746

Views

Maximum matching in a tree

Published on 11 May 2026 - 2:55

score 53 · Answer 5 · 2026-04-09 09:59:55

53

Views

Is there a name of this optimization problem or it is connected to some optimization problem?

Published on 09 Apr 2026 - 9:59

score 139 · Answer 6 · 2026-03-29 08:44:27

139

Views

When is the intersection of graph automorphism groups again the automorphism group of a graph?

Published on 29 Mar 2026 - 8:44

score 53 · Answer 7 · 2026-04-01 07:19:00

53

Views

There exists an $a-b-$path with alternating colours if there is no proper colouring of $G$ where $c(a)=c(b)$.

Published on 01 Apr 2026 - 7:19

score 63 · Answer 8 · 2026-05-10 14:07:31

63

Views

How many of different connected graphs with n vertices? Excluding of isomorphic graphs.

Published on 10 May 2026 - 14:07

score 33 · Answer 9 · 2026-04-14 12:49:28

33

Views

On the complexity of finding a minimal linear extension

Published on 14 Apr 2026 - 12:49

score 2.9k · Answer 10 · 2026-04-15 21:13:55

2.9k

Views

Cardinality of any maximal matching is at least half the cardinality of a maximum matching

Published on 15 Apr 2026 - 21:13

score 237 · Answer 11 · 2026-04-16 07:24:12

237

Views

Proof: compactness theorem applied to graph homomorphisms

Published on 16 Apr 2026 - 7:24

score 355 · Answer 12 · 2026-04-16 12:47:35

355

Views

Enumerating rooted forests/trees

Published on 16 Apr 2026 - 12:47

score 66 · Answer 13 · 2026-04-09 19:22:00

66

Views

Generating function for sum over irreducible/simple paths

Published on 09 Apr 2026 - 19:22

score 244 · Answer 14 · 2026-05-10 19:50:24

244

Views

Propositional formula which is satisfiable if theres a graph homomorphism?

Published on 10 May 2026 - 19:50

score 173 · Answer 15 · 2026-05-15 21:04:54

173

Views

Let $G=(V,E)$ be a graph with $|V|=6,|E|=10$. Prove there exists vertex $v$ such that $\deg v=4$ or $\deg v=5$- Possible pigeonhole solution?

Published on 15 May 2026 - 21:04

List Question

Maximum number of students such that they all have at least 3 out of 6 different answers.

Finding a cycle in a 3-partite graph

Let G be connected simple graph, where all the vertices have even degree. Prove the following formula.

Maximum matching in a tree

Is there a name of this optimization problem or it is connected to some optimization problem?

When is the intersection of graph automorphism groups again the automorphism group of a graph?

There exists an $a-b-$path with alternating colours if there is no proper colouring of $G$ where $c(a)=c(b)$.

How many of different connected graphs with n vertices? Excluding of isomorphic graphs.

On the complexity of finding a minimal linear extension

Cardinality of any maximal matching is at least half the cardinality of a maximum matching

Proof: compactness theorem applied to graph homomorphisms

Enumerating rooted forests/trees

Generating function for sum over irreducible/simple paths

Propositional formula which is satisfiable if theres a graph homomorphism?

Let $G=(V,E)$ be a graph with $|V|=6,|E|=10$. Prove there exists vertex $v$ such that $\deg v=4$ or $\deg v=5$- Possible pigeonhole solution?

Trending Questions

Popular # Hahtags

Popular Questions