Faculty

Institution

Unit

Venue

Gexin Yu

Professor

College of William and Mary

Affiliations

Arts & Sciences

Mathematics

Gexin Yu is currently serving as an Arts & Sciences Professor at College of William And Mary.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Gexin Yu

College of William and Mary

Professor

You can click a keyword to filter the displayed items

graph theory discrete mathematics combinatorics mathematics combinatorial theory extremal graph theory applied mathematics planar graphs structural graph theory geometric graph theory combinatorial optimization discrete algorithms topological graph theory algebraic graph theory geometric topology mathematical sciences computer science spectral theory graph drawing graph g representation theory geometry and topology extremal combinatorics computational geometry mathematical optimization probabilistic graph theory discrete geometry strong edge-coloring strong chromatic index subcubic graphs computational complexity random graphs graph minors combinatorial problems number theory computational optimization graph processing extremal problem infinite hexagonal grid strong edge-colorings sufficient degree conditions applied physics global optimization control optimization combinatory analysis combinatorial design theory graph algorithms link analysis linkage analysis hypergraph theory geometric algorithms injective colorings sparse graphs minimum degree conditions close triangles sparse planar graphs kite-linked graphs swarm intelligence numerical mathematics numerical algorithms polyhedron economic geology mathematical programming spectrum management cognitive radio graph sparsity hamiltonian theory graph matching algebraic coding theory enumerative combinatorics discrete optimization grid optimization geometry of numbers full duplex connectivity conditions degree conditions

Notable Scholarly Works

Notable Federal Grants

Collaborators

A New Connectivity Bound for a Tournament to Be Highly Linked. Graphs and Combinatorics (2025)

scalabilitynetwork convergenceglobal networksgraph theorynetwork algorithmsnew connectivity boundhighly linkedgame theorynetwork sciencenetwork gamesscale-free networknetworked system designnetwork analysiscomputer science

Cliques in Squares of Graphs With Maximum Average Degree Less Than 4. Journal of Graph Theory (2024)

Daniel W. CranstonGexin Yu

random graphsextremal graph theorystructural graph theorygraph theorygeometric graph theorymaximum average degreecombinatorial theorygraph analysisgroup theoryapplied mathematicsclusteringcombinatorial optimization

1-Planar Graphs Are Odd 13-Colorable. Discrete Mathematics (2023)

Runrun LiuWeifan WangGexin Yu

representation theoryrandom graphscombinatoricsalgebraic graph theoryextremal graph theoryplanar graphsgraph theorygeometric graph theorycombinatorial theorygeometry and topologydiscrete mathematicsmathematicsgeometric topology

Optimal Connectivity for Fat-Triangle Linkages. Discrete Mathematics (2023)

Runrun LiuMartin RolekGexin Yu

optimal connectivitysystems engineeringdiscrete mathematicsgraph theoryfat-triangle linkagesdiscrete geometry

Strong Edge-Coloring of 2-Degenerate Graphs. Discrete Applied Mathematics (2023)

Gexin YuRachel Yu

combinatoricsextremal graph theorystrong edge-coloringstructural graph theorygraph theorycombinatorial theorydiscrete mathematicsapplied mathematics

Enhancing the ErdőS‐LováSz Tihany Conjecture for Line Graphs of Multigraphs. Journal of Graph Theory (2022)

Yue WangGexin Yu

extremal graph theorystructural graph theorygraph theoryerdos-lovasz tihany conjectureline graphs

Note on Injective Edge-Coloring of Graphs. Discrete Applied Mathematics (2022)

Zhengke MiaoYimin SongGexin Yu

combinatoricsextremal graph theoryinjective edge-coloringstructural graph theorygraph processinggraph theorygeometric graph theorydiscrete algorithmscombinatorial theorycombinatorial optimizationdiscrete mathematicsgraph drawingapplied mathematics

Spanning Tree Packing and 2-Essential Edge-Connectivity. Discrete Mathematics (2022)

Xiaofeng GuRunrun LiuGexin Yu

discrete geometrytree packingmathematicsdiscrete mathematics

An Improved Linear Connectivity Bound for Tournaments to Be Highly Linked. European Journal of Combinatorics (2021)

Wei MengMartin RolekYue WangGexin Yu

combinatoricsgraph theoryapplied mathematicslink analysiscombinatorial designs

Connectivity for Kite-Linked Graphs. SIAM Journal on Discrete Mathematics (2021)

Runrun LiuMartin RolekD. Christopher StephensDong YeGexin Yu

combinatoricsextremal graph theorygraph theorygeometric graph theorytopological graph theorycombinatorial theorykite-linked graphsexact valuediscrete mathematicspendant edgemathematicsapplied mathematics

1
2
3
4
5
14
10 / page

Gexin Yu

Professor

College of William and Mary

Affiliations

Arts & Sciences

Mathematics

Gexin Yu is currently serving as an Arts & Sciences Professor at College of William And Mary.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Gexin Yu

College of William and Mary

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

A New Connectivity Bound for a Tournament to Be Highly Linked. Graphs and Combinatorics (2025)

Cliques in Squares of Graphs With Maximum Average Degree Less Than 4. Journal of Graph Theory (2024)

Daniel W. CranstonGexin Yu

1-Planar Graphs Are Odd 13-Colorable. Discrete Mathematics (2023)

Runrun LiuWeifan WangGexin Yu

Optimal Connectivity for Fat-Triangle Linkages. Discrete Mathematics (2023)

Runrun LiuMartin RolekGexin Yu

optimal connectivitysystems engineeringdiscrete mathematicsgraph theoryfat-triangle linkagesdiscrete geometry

Strong Edge-Coloring of 2-Degenerate Graphs. Discrete Applied Mathematics (2023)

Gexin YuRachel Yu

combinatoricsextremal graph theorystrong edge-coloringstructural graph theorygraph theorycombinatorial theorydiscrete mathematicsapplied mathematics

Enhancing the ErdőS‐LováSz Tihany Conjecture for Line Graphs of Multigraphs. Journal of Graph Theory (2022)

Yue WangGexin Yu

extremal graph theorystructural graph theorygraph theoryerdos-lovasz tihany conjectureline graphs

Note on Injective Edge-Coloring of Graphs. Discrete Applied Mathematics (2022)

Zhengke MiaoYimin SongGexin Yu

Spanning Tree Packing and 2-Essential Edge-Connectivity. Discrete Mathematics (2022)

Xiaofeng GuRunrun LiuGexin Yu

discrete geometrytree packingmathematicsdiscrete mathematics

An Improved Linear Connectivity Bound for Tournaments to Be Highly Linked. European Journal of Combinatorics (2021)

Wei MengMartin RolekYue WangGexin Yu

combinatoricsgraph theoryapplied mathematicslink analysiscombinatorial designs

Connectivity for Kite-Linked Graphs. SIAM Journal on Discrete Mathematics (2021)

Runrun LiuMartin RolekD. Christopher StephensDong YeGexin Yu

1
2
3
4
5
14
10 / page

Similar Faculty Members

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Xingxing Yu

Institution

Georgia Institute of Technology

discrete algorithm

extremal graph theory

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Andrzej Dudek

Institution

Western Michigan University

probability theory

combinatorial problem

Jacques Verstraete

Institution

University of California, San Diego

discrete algorithm

extremal graph theory

Richard Ehrenborg

Institution

University of Kentucky

mathematics education

discrete structure

Glenn Hurlbert

Institution

Virginia Commonwealth University

general graph theory

extremal graph theory

Louis Debiasio

Institution

Miami University

discrete algorithm

extremal/probabilistic graph theory

Dhruv Mubayi

Institution

University of Illinois Chicago

computational problem

probabilistic graph theory

Andrew Suk

Institution

University of California, San Diego

graph theory

applied mathematics

Similar Faculty Members

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Xingxing Yu

Institution

Georgia Institute of Technology

discrete algorithm

extremal graph theory

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Andrzej Dudek

Institution

Western Michigan University

probability theory

combinatorial problem

Jacques Verstraete

Institution

University of California, San Diego

discrete algorithm

extremal graph theory

Richard Ehrenborg

Institution

University of Kentucky

mathematics education

discrete structure

Glenn Hurlbert

Institution

Virginia Commonwealth University

general graph theory

extremal graph theory

Louis Debiasio

Institution

Miami University

discrete algorithm

extremal/probabilistic graph theory

Dhruv Mubayi

Institution

University of Illinois Chicago

computational problem

probabilistic graph theory

Andrew Suk

Institution

University of California, San Diego

graph theory

applied mathematics