On a problem of Turán in the theory of graphs 来自 ResearchGate 喜欢 0 阅读量: 99 作者:G Katona,T Nemetz,M Simonovits 摘要: A new short proof is given for the following theorem of Milner: An intersecting, inclusion-free family of subsets of ann-element set has at most[formula] ...
On an extremal problem concerning the theory of graphs[Article in Undetermined Language]doi:10.1007/BF01234331Chong-Yun ChaoDepartment of Mathematics, University of Pittsburgh, PittsburghBirkhäuser-VerlagArchiv der Mathematik
On an inequality in the problem of the approximation of graphs G. Sh. Fridman $39.95 / €34.95 / £29.95 * Rent the article at a discount Rent now * Final gross prices may vary according to local VAT. Get Access The complete tex of the paper has been submitted to the Editors...
A graph $G=(V,E)$ is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite $1$-planar graphs with prescribed numbers of vertices in partite sets. Bipartite 1-planar graphs are known to have at most $3n...
Y. Lin, \A level structure approach on the bandwidth problem for special graphs", Graph Theory and Its Applications: East and West, Proceedings of the First China-USA International Graph Theory Conference, Annals of the New York ... Y Lin - 《Annals of the New York Academy of Sciences》...
Phase synchronizations in models of coupled oscillators such as the Kuramoto model have been widely studied with pairwise couplings on arbitrary topologies, showing many unexpected dynamical behaviors. Here, based on a recent formulation the Kuramoto model on weighted simplicial complexes with phases supp...
Microgrids are power distribution systems that can operate either in a grid-connected configuration or in an islanded manner, depending on the availability of decentralized power resources, such as sustainable or non-sustainable power sources, battery ba
Dujiangyan Tuanjie Primary School teacher Huang Ping gave a special lecture on the second lesson of teacher Chen Yaling. Ms. Huang shared the authenticity of situation creation, the integration of problem solving and calculation, the visualization of thinking through multiple analysis, the visualization...
The Optimization Problem (OP)1 as defined by refers to the task of identifying the optimal choice among various strategies and parameters under specific conditions. This problem is prevalent in real-world applications and encompasses a wide range of scenarios where the goal is to find the best so...
Capacity limit is a bottleneck for broader applications of blockchain systems. Scaling up capacity while preserving security and decentralization are major challenges in blockchain infrastructure design. In this paper, we design a proof of work-based mechanism by endowing directed acyclic graphs (DAG)...