What is she best known for?
The fields of study she is best known for:
- Combinatorics
- Discrete mathematics
- Graph theory
Her scientific interests lie mostly in Combinatorics, Discrete mathematics, Cograph, Split graph and Chordal graph.
Her study in Distance-hereditary graph, Universal graph, Induced subgraph, Pathwidth and Forbidden graph characterization is done as part of Combinatorics.
Her Distance-hereditary graph research focuses on subjects like Perfect graph, which are linked to Perfect graph theorem and Strong perfect graph theorem.
Many of her studies involve connections with topics such as Tournament and Discrete mathematics.
Her Split graph research incorporates themes from Indifference graph, Clique-sum and Block graph.
The concepts of her Factor-critical graph study are interwoven with issues in Complement graph and Butterfly graph.
Her most cited work include:
- The Strong Perfect Graph Theorem (1011 citations)
- Recognizing Berge Graphs (276 citations)
- The roots of the independence polynomial of a clawfree graph (158 citations)
What are the main themes of her work throughout her whole career to date?
Maria Chudnovsky mostly deals with Combinatorics, Discrete mathematics, Graph, Induced subgraph and Conjecture.
Her Graph study combines topics from a wide range of disciplines, such as Chromatic scale and Open problem.
Her Induced subgraph study incorporates themes from Induced subgraph isomorphism problem, Reconstruction conjecture and Graph factorization.
The Conjecture study which covers Tournament that intersects with Digraph and Transitive relation.
Her Universal graph research includes elements of Neighbourhood, Factor-critical graph and Distance-hereditary graph.
Her study looks at the relationship between Strong perfect graph theorem and topics such as Perfect graph theorem, which overlap with Skew partition.
She most often published in these fields:
- Combinatorics (95.67%)
- Discrete mathematics (45.45%)
- Graph (38.53%)
What were the highlights of her more recent work (between 2018-2021)?
- Combinatorics (95.67%)
- Graph (38.53%)
- Induced subgraph (28.57%)
In recent papers she was focusing on the following fields of study:
Her main research concerns Combinatorics, Graph, Induced subgraph, Conjecture and Independent set.
While working on this project, Maria Chudnovsky studies both Combinatorics and Bounded function.
Graph is a subfield of Discrete mathematics that Maria Chudnovsky tackles.
Her study in the field of Perfect graph, Complement graph and Complete bipartite graph also crosses realms of Claw and Fork.
Her work in the fields of Induced subgraph, such as Erdős–Hajnal conjecture, intersects with other areas such as Maximum size.
Characterization and Cardinality is closely connected to Clique in her research, which is encompassed under the umbrella topic of Independent set.
Between 2018 and 2021, her most popular works were:
- Large rainbow matchings in general graphs (20 citations)
- Detecting an Odd Hole (12 citations)
- Four-coloring P6-free graphs (12 citations)
In her most recent research, the most cited papers focused on:
- Combinatorics
- Graph theory
- Graph coloring
Her primary areas of study are Combinatorics, Graph, Induced subgraph, Conjecture and Vertex.
Independent set, Time complexity, Graph, Graph coloring and Open problem are among the areas of Combinatorics where the researcher is concentrating her efforts.
Her research in Induced subgraph tackles topics such as Path which are related to areas like Degree, Counting problem and Connected component.
Her research in Conjecture intersects with topics in Clique number, Chromatic scale, Bipartite graph and Matching.
Her Vertex study integrates concerns from other disciplines, such as Disjoint sets, Undirected graph and Tournament.
Her Critical graph research is within the category of Discrete mathematics.
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.
