In a classroom, the teacher noticed that every time he formed a group of three students, always had two who were friends. And every time he formed a group of 4 students, always had two were not friends. Which is the largest number of students who have the classroom?
2026-03-26 09:51:26.1774518686
If every group of 3 students has two friends and every group of 4 has two non-friends, what is the largest possible number of students?
88 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in RAMSEY-THEORY
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Probability that in fully connected graph there is a clique of different colors
- Ramsey Number Upper Bound
- Ramsey Numbers with 3 Variables
- Van der Waerden type theorem
- Colouring of a grid $\mathbb{Z}^2$.
- Has this Ramsey-type function been studied?
- 2-coloring of R(m,m) with no monochromatic $K_m$
- Ramsey's Theorem(Numerical Example)
- Tic-tac-toe game on the cube 3×3×3
Related Questions in EXTREMAL-COMBINATORICS
- Given N sets of partitions, find a partition such that it satisfies a criterion
- A Combinatorial Geometry Problem With A Solution Using Extremal Principle
- Trying to compute a limit for the Turán number
- Problem 2.2 from Jukna's "Extremal Combinatorics"
- Combinations help please
- Given a graph with n vertices, if it have more than $\frac{nt}{2}$ edges then there exists a simple path of length $t+1$.
- Number of steps the path-avoiding snail must take before a step size of $(2n - 1)/2^k$?
- Upper bound on cumulative power of system of limitedly intersecting subsets?
- Extremal combinatorics problem on graph matching
- Smallest $r$ for which there is an $r$-coloring of the grid wherein no two colors are adjacent more than once.
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The largest number of students is $8$.
Assume that in the room are at least $9$ students. Then we keep some $9$ of students in the classroom and free away the rest of them. The remaining $9$ students still satisfy the question condition. If each student has exactly $5$ friends in the room then the total number of the pairs of friends is $5\cdot 9/2$ unnatural, so there exists a student $s$ which has $d\ne 5$ friends.
If $d\ge 6$ then by well-known problem among $6$ friends of $s$ there is a triple of mutual friends or a triple of mutual non-friends. The last case is impossible by the condition, the first case is impossible too because then this triple with added $s$ constitutes a quadruple of mutual friends.
If $d\le 4$ then $s$ has at least $4$ non-friends and among them each two are friends, which is impossible.
The following picture shows that there can be $8$ students in the classroom satisfying the question condition (here students are so humble that they look like small points but their friendship relations are so strong that are even visible as segments). This is a graph of the cube where we draw an additional diagonal on each face of the cube.
Congratulation, we have just showed that Ramsey number $R(3,4)$ is $9$.