Question

Smallest graph that is vertex-transitive but neither edge-transitive nor edge-flip-invariant?

score 530 · Answer 1 · 2026-03-25 10:37:27

530

Views

Smallest graph that is vertex-transitive but neither edge-transitive nor edge-flip-invariant?

Published on 25 Mar 2026 - 10:37

score 48 · Answer 2 · 2026-03-25 18:46:33

48

Views

How to characterize sail-free $3$-uniform hypergraph?

Published on 25 Mar 2026 - 18:46

score 152 · Answer 3 · 2026-03-25 01:32:20

152

Views

Maximal possible edges in graph

Published on 25 Mar 2026 - 1:32

score 407 · Answer 4 · 2026-03-24 16:49:25

407

Views

Maximum Edges in a simple graph

Published on 24 Mar 2026 - 16:49

score 280 · Answer 5 · 2026-03-24 20:32:09

280

Views

Maximum number of edges in a bipartite graph without $K_{s,t}$

Published on 24 Mar 2026 - 20:32

score 704 · Answer 6 · 2026-03-25 14:12:57

704

Views

Lower and upper bound for the maximal number of edges of a graph

Published on 25 Mar 2026 - 14:12

score 582 · Answer 7 · 2026-03-25 00:51:38

582

Views

Find the maximum number of 1s in matrix $A$ such that $A^2=0$ and elements of $A$ are either $0$ or $1$

Published on 25 Mar 2026 - 0:51

score 906 · Answer 8 · 2026-03-25 08:38:32

906

Views

Graph with 45 vertices, what is the maximum number of edges in such graph?

Published on 25 Mar 2026 - 8:38

score 481 · Answer 9 · 2026-03-25 04:44:53

481

Views

graph with $n$ vertices have having no subgraph isomorphic with $K_{2,t}$ can have at most $\frac{\sqrt{t-1}n^{3/2}+n}{2}$ edges

Published on 25 Mar 2026 - 4:44

score 49 · Answer 10 · 2026-03-25 05:50:14

49

Views

Maximize number of edges in a directed graph with vertex degrees bounded by one

Published on 25 Mar 2026 - 5:50

score 771 · Answer 11 · 2026-03-25 13:55:12

771

Views

smallest number of vertices of degree $1$ in tree with $3$ vertices of degree $4$ and $2$ of degree $5$

Published on 25 Mar 2026 - 13:55

score 255 · Answer 12 · 2026-03-25 05:58:03

255

Views

Smallest number of vertices in tree with specific degrees.

Published on 25 Mar 2026 - 5:58

score 548 · Answer 13 · 2026-03-24 18:13:22

548

Views

Finding a 3-regular graph "with least no. of vertiecs" containing P6 as an induced-subgraph

Published on 24 Mar 2026 - 18:13

score 95 · Answer 14 · 2026-03-25 05:54:51

95

Views

prove that every graph on $n$ vertices, $n\geq 4$, with more than $2n^{3/2}$ edges has girth of at most 4

Published on 25 Mar 2026 - 5:54

score 98 · Answer 15 · 2026-03-25 12:38:47

98

Views

Let $(A,B)$ be a bipartition with $|A|=|B|=n$, show that if $\Delta(G)$ is at most $\epsilon^2n$ then the pair $(A,B)$ is $\epsilon$-regular

Published on 25 Mar 2026 - 12:38

List Question

Smallest graph that is vertex-transitive but neither edge-transitive nor edge-flip-invariant?

How to characterize sail-free $3$-uniform hypergraph?

Maximal possible edges in graph

Maximum Edges in a simple graph

Maximum number of edges in a bipartite graph without $K_{s,t}$

Lower and upper bound for the maximal number of edges of a graph

Find the maximum number of 1s in matrix $A$ such that $A^2=0$ and elements of $A$ are either $0$ or $1$

Graph with 45 vertices, what is the maximum number of edges in such graph?

graph with $n$ vertices have having no subgraph isomorphic with $K_{2,t}$ can have at most $\frac{\sqrt{t-1}n^{3/2}+n}{2}$ edges

Maximize number of edges in a directed graph with vertex degrees bounded by one

smallest number of vertices of degree $1$ in tree with $3$ vertices of degree $4$ and $2$ of degree $5$

Smallest number of vertices in tree with specific degrees.

Finding a 3-regular graph "with least no. of vertiecs" containing P6 as an induced-subgraph

prove that every graph on $n$ vertices, $n\geq 4$, with more than $2n^{3/2}$ edges has girth of at most 4

Let $(A,B)$ be a bipartition with $|A|=|B|=n$, show that if $\Delta(G)$ is at most $\epsilon^2n$ then the pair $(A,B)$ is $\epsilon$-regular

Trending Questions

Popular # Hahtags

Popular Questions