For the class of bipartite graphs, Linek =-=[3]-=- answered the question affirmatively. Here we are interested in the class of trees. For k ∈ N, we say that k is constructible if there exists a tree T such that i(T) = k. For example, 1, 2, 3 are cons......
In particular, we give the exact value of $\ex(n,\{M_{s+1},F\})$ for $F$ being any non-bipartite graph or some bipartite graphs. Furthermore, we determine $\ex(n,K_r,\{M_{s+1},F\})$ when $F$ is color critical with $\chi(F)\ge \max\{r+1,4\}$. These extend ...
0104 Maximum Depth of Binary Tree Go 66.0% Easy 0105 Construct Binary Tree from Preorder and Inorder Traversal Go 48.8% Medium 0106 Construct Binary Tree from Inorder and Postorder Traversal Go 47.1% Medium 0107 Binary Tree Level Order Traversal II Go 53.5% Easy 0108 Convert Sorted Array...
In a bipartite graph G=(U∪V,E) G = ( U ∪ V , E ) mathContainer Loading Mathjax where EU×V E U × V mathContainer Loading Mathjax , a semi-matching is defined as a set of edges ME M E mathContainer Loading Mathjax , such that each vertex in U is incident with exactly ...
The Existence of Universally Agreed Fairest Semi-matchings in Any Given Bipartite Graphdoi:10.1007/978-3-319-62389-4_44Jian XuSoumya BanerjeeWenjing RaoSpringer, ChamComputing and Combinatorics Conference
A generalized Bethe tree is a rooted unweighted tree in which vertices at the same level have the same degree. Let G be any connected graph. Let G { B } be the graph obtained from G by attaching a generalized Bethe tree B, by its root, to each vertex of G. We characterize ...
In a bipartite graph G=(U∪V,E) G = ( U ∪ V , E ) mathContainer Loading Mathjax where E⊆U×V E ⊆ U × V mathContainer Loading Mathjax , a semi-matching is defined as a set of edges M⊆E M ⊆ E mathContainer Loading Mathjax , such that each vertex in U ...
The existence of universally agreed fairest semi-matchings in any given bipartite graphdoi:10.1016/j.tcs.2018.03.020Jian XuSoumya BanerjeeWenjing RaoElsevier