Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Graphical Representation of Inequalities01:28

Graphical Representation of Inequalities

282
The graph of the equation where y equals x squared forms a curve known as a parabola. This curve acts as a boundary in the coordinate plane, dividing it into distinct regions based on the relative position of points.When the equality sign in the equation is replaced with an inequality—such as greater than, less than, greater than or equal to, or less than or equal to—the graphical representation changes from a single curve into a broader shaded area that signifies the set of all...
282
Graphs of Equations in Two Variables01:30

Graphs of Equations in Two Variables

312
An equation with two variables, typically written in the form y = f(x) or Ax + By = C, describes a relationship between quantities represented by x and y. Each solution to such an equation is an ordered pair (x, y) that satisfies the equation when substituted. These pairs can be represented graphically to understand the variables' relationship visually.A common technique for constructing the graph of a two-variable equation is to create a value table. Begin by choosing several values for the...
312
Graphs of Functions01:30

Graphs of Functions

403
Graphs of functions provide a visual representation of how output values change in response to varying inputs. Each point on the graph corresponds to an ordered pair, where the x-coordinate (independent variable) determines the horizontal position and the y-coordinate (dependent variable) determines the vertical position. Linear functions like y = x give a straight line, indicating a constant rate of change.Nonlinear functions display more complex behaviors. Even power functions generate...
403
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

18.2K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
18.2K
Graphs of Polar Equations01:17

Graphs of Polar Equations

364
The polar coordinate system represents points using a distance from a central point (the pole) and an angle from a reference direction (the polar axis). Unlike rectangular coordinates, polar coordinates are ideal for graphing curves with radial symmetry or periodic behavior.Some general forms of graphs in polar coordinates include the following:Equation of a Circle (Centered at the Pole):A graph where the radius remains constant for all angles traces a circle centered at the pole:Equation of a...
364
Second Uniqueness Theorem01:16

Second Uniqueness Theorem

2.7K
Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
2.7K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Emotion regulation in mother-child dyads is associated with interbrain synchrony during imagined shared emotional experiences.

Frontiers in psychology·2026
Same author

Cocktail-style multifunctional resuscitation fluids: Where are we now in 2026?

Journal of anesthesia and translational medicine·2026
Same author

Glottic-level, anesthesia machine-based high-frequency ventilation as an oxygenation bridge for short pediatric gastroscopy under intravenous anesthesia: a nine-patient case series.

Journal of anesthesia·2026
Same author

Near-Flat End-Tidal Carbon Dioxide During Mechanically Ventilated Cardiopulmonary Resuscitation in Pulmonary Atresia With Collateral-Dependent Pulmonary Blood Flow.

Journal of cardiothoracic and vascular anesthesia·2026
Same author

Fecal ACE and ACE2 Activities Reflect Intestinal Shedding and Microbiota Modulation of Renin-Angiotensin System.

Biology·2026
Same author

Characteristics of Bibliometric Analyses of the Complementary, Alternative, and Integrative Medicine Literature: A Scoping Review.

Journal of integrative and complementary medicine·2026

Related Experiment Video

Updated: Feb 28, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.4K

Monochromatic Clique Decompositions of Graphs.

Henry Liu1, Oleg Pikhurko2, Teresa Sousa3

  • 1CENTRO DE MATEMÁTICA E APLICAÇÕESFACULDADE DE CIÊNCIAS E TECNOLOGIA, UNIVERSIDADE NOVA DE LISBOACAMPUS DE CAPARICA2829-516CAPARICAPORTUGAL.

Journal of Graph Theory
|June 16, 2017
PubMed
Summary

This study investigates monochromatic H-decompositions in k-edge-colored graphs. Researchers solved this problem for clique graphs H when the graph order n is sufficiently large.

Keywords:
Ramsey numberTurán numbermonochromatic graph decomposition

More Related Videos

Characterization of Human Monocyte Subsets by Whole Blood Flow Cytometry Analysis
09:12

Characterization of Human Monocyte Subsets by Whole Blood Flow Cytometry Analysis

Published on: October 17, 2018

59.0K
Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.6K

Related Experiment Videos

Last Updated: Feb 28, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.4K
Characterization of Human Monocyte Subsets by Whole Blood Flow Cytometry Analysis
09:12

Characterization of Human Monocyte Subsets by Whole Blood Flow Cytometry Analysis

Published on: October 17, 2018

59.0K
Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.6K

Area of Science:

  • Graph Theory
  • Combinatorics
  • Discrete Mathematics

Background:

  • Introduces monochromatic H-decompositions in k-edge-colored graphs.
  • Defines the problem of partitioning edge sets into monochromatic subgraphs.
  • Builds upon prior work on monochromatic Kr-decompositions.

Purpose of the Study:

  • To determine the minimum number of elements in a monochromatic H-decomposition for a given graph G.
  • To solve this problem for the specific case where H consists of cliques.
  • To analyze the behavior of such decompositions for large graph orders (n).

Main Methods:

  • Focuses on graph theory and combinatorial techniques.
  • Extends existing results by Liu and Sousa.
  • Analyzes edge-colored graphs and their partitions.

Main Results:

  • Solves the monochromatic H-decomposition problem for clique graphs H.
  • Establishes bounds for the decomposition size (phi_k(n,H)).
  • The solution is valid for sufficiently large graph orders (n >= n0(H)).

Conclusions:

  • Provides a complete solution for monochromatic clique-tuple decompositions in k-edge-colored graphs.
  • Demonstrates the existence of such decompositions with a limited number of elements.
  • Highlights the significance of graph order in decomposition properties.