Live briefing
Everything about Indifference graph
Intersection graph of unit intervals on the real line
In graph theory, a branch of mathematics, an indifference graph is an undirected graph constructed by assigning a real number to each vertex and connecting two vertices by an edge when their numbers are within one unit of each other. An indifference graph is also the intersection graph of a set of unit intervals, or of properly nested intervals. Based on these two types of interval representations, these graphs are also called unit interval graphs or proper interval graphs; they form a subclass of the interval graphs. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Indifference graphA 5-minute orientation
- Skim a recent paper: Indifference orders and split-indifference graphs: thirty years of productive collaborative workInfluential work since 2022
- Pick up a classic book: Basic economicsThe most-reprinted book on the subject
- Read the landmark paper: Indifference Digraphs: A Generalization of Indifference Graphs and SemiordersCited 23 times
- Go sideways: Strongly chordal graphA closely related topic
- Go sideways: Trivially perfect graphA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
🆕 Influential since 2022
đź“š Books worth reading
Basic economicsEdwin G. Dolan, David E. Lindsey · 1977
Graphing Jane AustenJoseph Carroll · 2012
A Course In Game TheoryThomas S. Ferguson · 2020
TAYLOR EconomicsJohn B. Taylor · 2003- 📕Economics Simplified · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Strongly chordal graph In the mathematical area of graph theory, an undirected graph G is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in G…
- Trivially perfect graph In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals…
- Caterpillar tree In graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path. Caterpillars were first…
- Threshold graph In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations:…
- Perfect graph In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every…
- Claw-free graph In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the…
- Cograph In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation…
- Distance-hereditary graph In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances…