Faculty

Institution

Unit

Venue

Bernard Lidický

Professor & Associate Chair for Research and Faculty Development

Iowa State University

Affiliations

College of Liberal Arts and Sciences

Mathematics

Bernard Lidický is currently serving as a College Of Liberal Arts And Sciences Professor & Associate Chair for Research and Faculty Development at Iowa State University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Bernard Lidický

Iowa State University

Professor & Associate Chair for Research and Faculty Development

You can click a keyword to filter the displayed items

graph theory combinatorics discrete mathematics applied mathematics mathematics combinatorial theory extremal graph theory computer science discrete algorithms geometric graph theory extremal combinatorics planar graphs algebraic graph theory theoretical computer science computational complexity combinatorial optimization enumerative combinatorics discrete geometry computational geometry mathematical optimization topological graph theory theory of computation polyhedron mathematical sciences discrete modeling structural graph theory hypergraph theory polychromatic colorings fine structure machine learning geometric topology spectral theory topological combinatorics geometric algorithms applied algebra discrete optimization lower bounds packing chromatic number bounded degree short proof r-partite graph plane graphs physics control optimization world psychiatry legal medicine pain research health information science internal medicine facial pain medical history graph drawing lattice theory inductive inference voronoi diagram convex hulls text processing colorization pigments document processing string processing graph analysis partition (database) combinatorial problems higher dimensional problems computational complexity theory algebraic combinatorics 6-cycle-free subgraphs iterated blow-up induced 5-cycle maximum density infinite product graphs turan number randic index planar slope number claw-free graphs

Notable Scholarly Works

Notable Federal Grants

Collaborators

10 Problems for Partitions of Triangle-Free Graphs. European Journal of Combinatorics (2023)

József BaloghFelix Christian ClemenBernard Lidický

combinatoricsextremal graph theorytriangle-free graphsgraph theorygeometric graph theorydiscrete algorithmscombinatorial theorycombinatorial optimizationdiscrete mathematicsmathematics

C5 ${C}_{5}$ is Almost a Fractalizer. Journal of Graph Theory (2023)

Bernard LidickýConnor MattesFlorian Pfender

graph theoryapplied mathematics

Crossing Numbers of Complete Bipartite Graphs. Procedia Computer Science (2023)

József BaloghBernard LidickýSergey NorinFlorian PfenderGelasio SalazarSam Spiro

combinatoricsalgebraic graph theoryextremal graph theoryextremal combinatoricsmathematical sciencescomplete bipartite graphgraph theorygeometric graph theorycombinatorial theorycomplete bipartite graphsnumber theorynumber crdiscrete mathematicsmathematicsapplied mathematics

Nearly All 𝑘-Sat Functions Are Unate. (2023)

József BaloghDingding DongBernard LidickýNitya ManiYufei Zhao

combinatoricstheory of computationmathematical sciencesboolean functiondiscrete mathematicscircuit complexitycombinatorial theory𝑘-sat functionsn boolean variablesapplied mathematicsk-sat functionscomputability theorymathematical logicmathematics

The Spectrum of Triangle-Free Graphs. SIAM Journal on Discrete Mathematics (2023)

József BaloghFelix Christian ClemenBernard LidickýSergey NorinJan Volec

combinatoricsalgebraic graph theoryextremal graph theorystructural graph theorytriangle-free graphgraph theoryupper boundcombinatorial theorysmallest eigenvaluespectral theorydiscrete mathematicsmathematicsapplied mathematics

Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM Journal on Discrete Mathematics (2022)

Adam BlumenthalBernard LidickýRyan R. MartinSergey NorinFlorian PfenderJan Volec

discrete mathematicshall ratioapplied mathematics

Maximum Number of Almost Similar Triangles in the Plane. Computational Geometry (2022)

József BaloghFelix Christian ClemenBernard Lidický

polyhedroncombinatoricscomputational geometrygeometrymaximum numberdiscrete geometrydelaunay triangulationgeometric algorithms

On Tripartite Common Graphs. Combinatorics Probability Computing (2022)

Andrzej GrzesikJoonkyung LeeBernard LidickýJan Volec

tripartite common graphsgraph theorycombinatoricsprobability theory

On Weak Flexibility in Planar Graphs. Graphs and Combinatorics (2022)

Bernard LidickýTomáš MasaříkKyle MurphyShira Zerbib

weak flexibilitygraph theorycombinatorics

Planar TuráN Numbers of Cycles: A Counterexample. The Electronic Journal of Combinatorics (2022)

Daniel W. CranstonBernard LidickýXiaonan LiuAbhinav Shantanam

combinatoricsplanar turan numbers

1
2
3
4
5
9
10 / page

Bernard Lidický

Professor & Associate Chair for Research and Faculty Development

Iowa State University

Affiliations

College of Liberal Arts and Sciences

Mathematics

Bernard Lidický is currently serving as a College Of Liberal Arts And Sciences Professor & Associate Chair for Research and Faculty Development at Iowa State University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Bernard Lidický

Iowa State University

Professor & Associate Chair for Research and Faculty Development

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

10 Problems for Partitions of Triangle-Free Graphs. European Journal of Combinatorics (2023)

József BaloghFelix Christian ClemenBernard Lidický

combinatoricsextremal graph theorytriangle-free graphsgraph theorygeometric graph theorydiscrete algorithmscombinatorial theorycombinatorial optimizationdiscrete mathematicsmathematics

C5 ${C}_{5}$ is Almost a Fractalizer. Journal of Graph Theory (2023)

Bernard LidickýConnor MattesFlorian Pfender

graph theoryapplied mathematics

Crossing Numbers of Complete Bipartite Graphs. Procedia Computer Science (2023)

József BaloghBernard LidickýSergey NorinFlorian PfenderGelasio SalazarSam Spiro

Nearly All 𝑘-Sat Functions Are Unate. (2023)

József BaloghDingding DongBernard LidickýNitya ManiYufei Zhao

The Spectrum of Triangle-Free Graphs. SIAM Journal on Discrete Mathematics (2023)

József BaloghFelix Christian ClemenBernard LidickýSergey NorinJan Volec

Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM Journal on Discrete Mathematics (2022)

Adam BlumenthalBernard LidickýRyan R. MartinSergey NorinFlorian PfenderJan Volec

discrete mathematicshall ratioapplied mathematics

Maximum Number of Almost Similar Triangles in the Plane. Computational Geometry (2022)

József BaloghFelix Christian ClemenBernard Lidický

polyhedroncombinatoricscomputational geometrygeometrymaximum numberdiscrete geometrydelaunay triangulationgeometric algorithms

On Tripartite Common Graphs. Combinatorics Probability Computing (2022)

Andrzej GrzesikJoonkyung LeeBernard LidickýJan Volec

tripartite common graphsgraph theorycombinatoricsprobability theory

On Weak Flexibility in Planar Graphs. Graphs and Combinatorics (2022)

Bernard LidickýTomáš MasaříkKyle MurphyShira Zerbib

weak flexibilitygraph theorycombinatorics

Planar TuráN Numbers of Cycles: A Counterexample. The Electronic Journal of Combinatorics (2022)

Daniel W. CranstonBernard LidickýXiaonan LiuAbhinav Shantanam

combinatoricsplanar turan numbers

1
2
3
4
5
9
10 / page

Similar Faculty Members

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Brendan T. Nagle

Institution

University of South Florida

hypergraph theory

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Gyorgy Turan

Institution

University of Illinois Chicago

computational intelligence

automated reasoning

Michael Young

Institution

Carnegie Mellon University

computational thinking

memetic computing

Richard Ehrenborg

Institution

University of Kentucky

mathematics education

discrete structure

Andrew Suk

Institution

University of California, San Diego

graph theory

applied mathematics

Robert E Jamison

Institution

Clemson University

quantitative science study

mathematics education

Glenn Hurlbert

Institution

Virginia Commonwealth University

general graph theory

extremal graph theory

Similar Faculty Members

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Brendan T. Nagle

Institution

University of South Florida

hypergraph theory

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Gyorgy Turan

Institution

University of Illinois Chicago

computational intelligence

automated reasoning

Michael Young

Institution

Carnegie Mellon University

computational thinking

memetic computing

Richard Ehrenborg

Institution

University of Kentucky

mathematics education

discrete structure

Andrew Suk

Institution

University of California, San Diego

graph theory

applied mathematics

Robert E Jamison

Institution

Clemson University

quantitative science study

mathematics education

Glenn Hurlbert

Institution

Virginia Commonwealth University

general graph theory

extremal graph theory