Exercises
Multiple Choice
Articles
Open Problems
Login
16 items
Tagged:
extremal graph theory
x
trees
x
Start over
- to expand, or dig in by adding more tags and revising the query.
Sort By:
trending ▼
date
0
Undergraduate
By
rizwanhudda
on Aug. 24, 2012 | Updated Dec. 6, 2017
Second Minimum spanning tree
Given an weighted undirected graph \( G = (V, E)\), and \(w : E \mapsto R^+\). Let T be MST i,e minimum spanning tree of graph G. Second MST is a Tree T' different from T, and its weight is less t…
Computer Science
Mathematics
Algorithms
Graph Theory
trees
0
Undergraduate
By
Shiva Kintali
on May 31, 2012 | Updated Dec. 6, 2017
Party Problem
Suppose there are six people at a party. Prove that there are always three of them so that every two know each other (or) no two know each other. In other words, let the edges of the complete graph o…
Mathematics
Puzzles
Combinatorics
Graph Theory
Puzzles
counting
extremal graph theory
interview question
0
Undergraduate
By
Shiva Kintali
on June 8, 2012 | Updated Dec. 6, 2017
Linear time algorithms on trees
Let \(T(V,E)\) be a tree. Design linear time (i.e., \(O(|V|)\) time) algorithms for the following problems : Find an optimal vertex cover in \(T\). Find a maximum matching in \(T\). Find a maximum i…
Computer Science
Mathematics
Algorithms
Graph Theory
independent set
linear time algorithms
matching
trees
vertex cover
0
Undergraduate
By
Shiva Kintali
on July 10, 2012 | Updated Dec. 6, 2017
Diameter of a tree
Let \(T(V, E)\) be a tree given as an adjacency list. For vertices \(u, v \in V\), let \(d(u, v)\) denote the length of the path from \(u\) to \(v\) in \(T\). Give a linear-time algorithm to determine…
Computer Science
Mathematics
Algorithms
Graph Theory
linear time algorithms
trees
0
Undergraduate
By
Shiva Kintali
on July 2, 2012 | Updated Dec. 6, 2017
Linear time tree isomorphism
Let \(T_1 (V_1,E_2)\) and \(T_2(V_2,E_2)\) be two undirected unlabeled trees. Design a linear-time algorithm to decide if \(T_1\) is isomorphic to \(T_2\).
Computer Science
Mathematics
Algorithms
Graph Theory
graph isomorphism
linear time algorithms
trees
0
Undergraduate
By
Shiva Kintali
on June 17, 2012 | Updated Dec. 6, 2017
Turan geometry
Let \(x_1, x_2, \dots, x_n\) be a set of diameter one in the plane. Prove that the maximum number of pairs of points at distance greater than \(1/\sqrt{2}\) is \(\lfloor n^2/3\rfloor\).
Mathematics
Geometry
Graph Theory
extremal graph theory
0
Undergraduate
By
Shiva Kintali
on June 6, 2013 | Updated Dec. 6, 2017
There are exactly _________ spanning trees on the vertex set {\(1, \dots , n\)}.
Mathematics
Graph Theory
counting
trees
0
Undergraduate
By
Shiva Kintali
on Oct. 4, 2013 | Updated Jan. 4, 2018
Trees and non-planarity
Let \(V\) be a set of vertices, and let \(T_1=(V,E_1)\), \(T_2=(V,E_2)\), and \(T_3=(V,E_3)\) be three trees on the vertices of \(V\) with disjoint sets of edges: …
Mathematics
Graph Theory
planar graphs
trees
0
Undergraduate
By
Shiva Kintali
on Oct. 3, 2013 | Updated Jan. 4, 2018
Leaves in a tree
Prove that every tree has at least two leaves (i.e., vertices of degree \(1\)). Prove that every tree with maximum degree \(\Delta>1\) has at least \(\Delta\) leaves.
Mathematics
Graph Theory
counting
trees
0
Undergraduate
By
Shiva Kintali
on Sept. 27, 2013 | Updated Jan. 4, 2018
Minimum spanning trees
Suppose we are given a connected graph \(G\) with weights on edges, such that all edge weights are distinct. For any cycle in \(G\), prove that the maximum weight edge in the cycle cannot be in a…
Computer Science
Mathematics
Algorithms
Graph Theory
graph cut
spanning tree
trees
1
2
next page »
icon
Sign In or Sign Up
icon
Invite Friends
Post Something
x
Select What You'd Like To Post
POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION
Content Types
Articles
Open Problems
Exercises
Multiple-Choice Questions
Levels
High school
Undergraduate
Graduate
Subjects
Mathematics
Computer Science
Puzzles
Optimization
Trending tags
math puzzle
binary tree
expectation
infinite series
riemann zeta function
conditional expectation
derandomization
sat
counting
trees
Topics
Algebra
Algorithms
Approximation Algorithms
Calculus
Combinatorial Optimization
Combinatorics
Complexity Theory
Data Structures
Discrete Mathematics
Game Theory
Geometry
Graph Theory
Linear Algebra
Linear Programming
Logic
Mathematical Analysis
Mathematics
Matrix Theory
Number Theory
Optimization
Probability
Programming
Puzzles
Randomized Algorithms
Real Analysis
Trigonometry
×