What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Geometry
His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Conjecture and Graph power.
His Combinatorics study which covers Upper and lower bounds that intersects with Hadwiger number.
His work carried out in the field of Discrete mathematics brings together such families of science as Chromatic scale and Degree.
Alexandr V. Kostochka has included themes like Bipartite graph and Total coloring in his Degree study.
His Graph research includes elements of Disjoint sets and Cartesian product.
His Conjecture research incorporates elements of Graph colouring, Class, Path, Line graph and Simple graph.
His most cited work include:
- Lower bound of the hadwiger number of graphs by their average degree (259 citations)
- List Edge and List Total Colourings of Multigraphs (216 citations)
- The minimum Hadwiger number for graphs with a given mean degree of vertices (146 citations)
What are the main themes of his work throughout his whole career to date?
Alexandr V. Kostochka focuses on Combinatorics, Discrete mathematics, Graph, Conjecture and Upper and lower bounds.
Hypergraph, List coloring, Degree, Vertex and Chromatic scale are the core of his Combinatorics study.
His work in List coloring addresses issues such as Complete coloring, which are connected to fields such as Fractional coloring.
His work on Discrete mathematics deals in particular with Planar graph, Graph power, Edge coloring, Brooks' theorem and Bound graph.
As a part of the same scientific family, Alexandr V. Kostochka mostly works in the field of Edge coloring, focusing on Graph coloring and, on occasion, Equitable coloring.
He combines subjects such as Disjoint sets and Bounded function with his study of Graph.
He most often published in these fields:
- Combinatorics (102.34%)
- Discrete mathematics (60.42%)
- Graph (36.72%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (102.34%)
- Graph (36.72%)
- Hypergraph (13.80%)
In recent papers he was focusing on the following fields of study:
Alexandr V. Kostochka mostly deals with Combinatorics, Graph, Hypergraph, Upper and lower bounds and Conjecture.
Alexandr V. Kostochka frequently studies issues relating to Discrete mathematics and Combinatorics.
His Discrete mathematics research is multidisciplinary, incorporating elements of Tree and Discharging method.
His biological study spans a wide range of topics, including Multiset, Chromatic scale and Partition.
His Upper and lower bounds research includes themes of Degree, Cubic graph, Bounded function and Girth.
His Conjecture research is multidisciplinary, relying on both Dense graph and Edge.
Between 2016 and 2021, his most popular works were:
- On DP-coloring of graphs and multigraphs (41 citations)
- DP-colorings of graphs with high chromatic number (35 citations)
- Packing chromatic number of cubic graphs (25 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Discrete mathematics
His primary areas of investigation include Combinatorics, Graph, Discrete mathematics, Hypergraph and List coloring.
His Combinatorics study frequently involves adjacent topics like Upper and lower bounds.
His study in the field of Graph property is also linked to topics like Social connectedness.
The various areas that Alexandr V. Kostochka examines in his Discrete mathematics study include Chromatic scale and Tree.
The Hypergraph study combines topics in areas such as Structure and Block.
His Bipartite graph research integrates issues from Fractional coloring, Circumference, Degree and Girth.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
