Fan Yang

ORCID: 0000-0003-1511-6586
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Graph Theory Research
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Graph theory and applications
  • graph theory and CDMA systems
  • Complexity and Algorithms in Graphs
  • Computational Geometry and Mesh Generation
  • Enhanced Oil Recovery Techniques
  • Seismic Imaging and Inversion Techniques
  • Hydrogen Storage and Materials
  • Integrated Energy Systems Optimization
  • Wind Energy Research and Development
  • Geology and Paleoclimatology Research
  • Chronic Obstructive Pulmonary Disease (COPD) Research
  • Hybrid Renewable Energy Systems
  • Archaeology and ancient environmental studies
  • Neonatal Respiratory Health Research
  • Spacecraft and Cryogenic Technologies
  • Energy Load and Power Forecasting
  • Hydrocarbon exploration and reservoir analysis
  • Global Healthcare and Medical Tourism
  • Structural Analysis and Optimization
  • Optimization and Search Problems
  • Finite Group Theory Research
  • DNA and Biological Computing

Shandong University
2012-2025

Shandong First Medical University
2021

Carnegie Mellon University
2017

Shandong Management University
2012

Abstract For a graph with average degree and constant , we denote by the minimum order of subgraph . Liu Montgomery conjectured that every contains as subdivision for In paper, prove this conjecture.

10.1112/jlms.70073 article EN Journal of the London Mathematical Society 2025-02-01

The Yiluo River Basin is located in the Central plains of China, an area commonly known as center origin ancient Chinese civilization. Agriculture lays foundation for social and economic development triggers societal change archaeobotany can provide important clues on this issue. archaeobotanical study perspective relationship between agriculture society development. However, relatively few studies have been conducted basin, paucity data has hindered our understanding society. Therefore,...

10.3389/feart.2022.885837 article EN cc-by Frontiers in Earth Science 2022-07-01

Let $G$ be a $\{C_4, C_5\}$-free planar graph with list assignment $L$. Suppose preferred color is given for some of the vertices. We prove that if all lists have size at least four, then there exists an $L$-coloring respecting constant fraction preferences.

10.48550/arxiv.2006.05243 preprint EN other-oa arXiv (Cornell University) 2020-01-01

10.1016/j.ejc.2022.103510 article EN European Journal of Combinatorics 2022-02-03

10.1007/s00373-022-02480-4 article EN Graphs and Combinatorics 2022-03-14

10.1016/j.ejc.2022.103533 article EN publisher-specific-oa European Journal of Combinatorics 2022-04-01

10.1016/j.dam.2022.08.006 article EN Discrete Applied Mathematics 2022-08-18

Scenario analysis is an effective method to deal with stochastic optimization of wind-integrated power system. Facing the uncertainty wind forecast error, it very important generate high quality scenarios make results both economical and conservative. To solve this problem, in terms scenario generation, a generation which combines state characteristics errors proposed. In method, transition matrix used transform curve into series probability dynamic are extracted from states by random...

10.1109/cac53003.2021.9728640 article EN 2021 China Automation Congress (CAC) 2021-10-22

Abstract Background: Ventilator-induced lung injury (VILI) is a common complication in the treatment of respiratory diseases with high morbidity and mortality. Matrix metalloprotein (MMP) 9 Elk1 are involved VILI, but roles have not been fully elucidated. This study examined mechanisms activation MMP-9 regulating barrier function VILI vitro vivo . Methods: For study, MLE-12 cells were pre-treated siRNA or for 48 h prior to cyclic stretch at 20% 4 h. C57BL/6 mice 72 4h mechanical ventilation....

10.21203/rs.3.rs-476628/v1 preprint EN cc-by Research Square (Research Square) 2021-05-06

We study a randomized algorithm for graph domination, by which, according to uniformly chosen permutation, vertices are revealed and added the dominating set if not already dominated. determine expected size of produced path $P_n$ use this derive some related families graphs. then provide much-refined analysis worst best cases on enumerate permutations which has worst-possible performance best-possible performance. The case connections previous work Bouwer Star, Gessel greedily coloring path.

10.48550/arxiv.1509.08876 preprint EN other-oa arXiv (Cornell University) 2015-01-01

We study a randomized algorithm for graph domination, by which, according to uniformly chosen permutation, vertices are revealed and added the dominating set if not already dominated. determine expected size of produced path $P_n$ use this derive some related families graphs. then provide much-refined analysis worst best cases on enumerate permutations which has worst-possible performance best-possible performance. The case connections previous work Bouwer Star, Gessel greedily coloring...

10.23638/dmtcs-19-2-2 article EN cc-by Discrete Mathematics & Theoretical Computer Science 2017-12-20

The identification of rock structure has a significant impact on the mechanical properties and seepage characteristics reservoir. In order to truly, accurately intuitively characterize pore rocks, thick limestone core samples in Baotu Spring basin were scanned by CT three-dimensional digital was constructed, finally display quantitative characterization realized. research shows that types this mass are mainly intergranular pores, dissolution pores few with an average radius 15.71 μm...

10.1109/ichce57331.2022.10042636 article EN 2022 8th International Conference on Hydraulic and Civil Engineering: Deep Space Intelligent Development and Utilization Forum (ICHCE) 2022-11-25

Given graphs $G, H_1, H_2$, we write $G \rightarrow ({H}_1, H_2)$ if every $\{$red, blue$\}$-coloring of the edges $G$ contains a red copy $H_1$ or blue $H_2$. A non-complete graph is $(H_1, H_2)$-co-critical \nrightarrow H_2)$, but $G+e\rightarrow for edge $e$ in $\overline{G}$. Motivated by conjecture Hanson and Toft from 1987, study minimum number over all $(K_t, K_{1,k})$-co-critical on $n$ vertices. We prove that $t\ge3$ $k\ge 3$, there exists constant $\ell(t, k)$ such that, $n \ge...

10.48550/arxiv.2104.13898 preprint EN cc-by-nc-nd arXiv (Cornell University) 2021-01-01
Coming Soon ...