Tibor Szabó

ORCID: 0000-0003-0599-0624
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Limits and Structures in Graph Theory
  • Plant Physiology and Cultivation Studies
  • Advanced Graph Theory Research
  • Horticultural and Viticultural Research
  • Plant and animal studies
  • Insect and Pesticide Research
  • Insect and Arachnid Ecology and Behavior
  • Plant Reproductive Biology
  • graph theory and CDMA systems
  • Game Theory and Applications
  • Graph theory and applications
  • Advanced Topology and Set Theory
  • Complexity and Algorithms in Graphs
  • Photosynthetic Processes and Mechanisms
  • Electrochemical sensors and biosensors
  • Stochastic processes and statistical mechanics
  • Graph Labeling and Dimension Problems
  • Postharvest Quality and Shelf Life Management
  • Game Theory and Voting Systems
  • Artificial Intelligence in Games
  • Computational Geometry and Mesh Generation
  • Topological and Geometric Data Analysis
  • Photoreceptor and optogenetics research
  • Berry genetics and cultivation research
  • Agriculture and Biological Studies

Freie Universität Berlin
2015-2024

University of Szeged
2013-2023

Eötvös Loránd University
1996-2022

Constantine the Philosopher University in Nitra
2020-2022

University of Trnava
2022

Comenius University Bratislava
2022

Hungarian Academy of Sciences
2007-2021

HUN-REN Institute for Nuclear Research
2017-2021

Danube Research Institute
2021

Budapest University of Economics and Business
2016-2020

The feasibility of the application Photo-Fenton process in treatment aqueous solution contaminated by Tylosin antibiotic was evaluated. Response Surface Methodology (RSM) based on Central Composite Design (CCD) used to evaluate and optimize effect hydrogen peroxide, ferrous ion concentration initial pH as independent variables total organic carbon (TOC) removal response function. interaction effects optimal parameters were obtained using MODDE software. significance their interactions tested...

10.3390/ma9060428 article EN Materials 2016-05-30

10.1006/jctb.1999.1906 article EN publisher-specific-oa Journal of Combinatorial Theory Series B 1999-07-01

Summary Sour cherry ( Prunus cerasus L.) cultivars native to Hungary and some of them grown worldwide, display great phenotypic variability. Eleven sour were analysed for their main quality attributes including fruit weight, soluble solid content, acidity, pH, specific sugars (glucose fructose), antioxidant capacity as well total polyphenolic (TPC), anthocyanin (TMAC) vitamin C contents. Results showed wide variation in both parameters Hungarian cherries. The contents varied from 11.3 93.5...

10.1111/j.1365-2621.2009.02168.x article EN International Journal of Food Science & Technology 2010-01-25

10.1016/j.jctb.2008.04.001 article EN publisher-specific-oa Journal of Combinatorial Theory Series B 2008-05-13

SummaryFor three consecutive years, the flight activity from 10 honeybee colonies was recorded for a whole day at beginning, middle and end of flow. The outgoing flights started about 9.00 h reach maximum between 14.00 16.00 ceased 21.00 h. Multiple correlation coefficients humidity, temperature, wind speed light intensity with ranged + 0·701 to 0·978, all highly significant. Correlation temperature 0·532 0.947, also There significant direct relationship colony weight gain 30 min later. This...

10.1080/00218839.1980.11100017 article EN Journal of Apicultural Research 1980-01-01

Suppose we are given (the edge graph of) an n-dimensional hypercube with its edges oriented so that every face has a unique sink. Such orientation is called sink orientation, and interested in finding the of whole cube, when implicitly. The basic operation available so-called vertex evaluation, where can access arbitrary for which obtain orientations incident edges. Unique occur deformed geometric cube (i.e., polytope combinatorial structure cube) according to some generic linear function....

10.1109/sfcs.2001.959931 article EN 2001-01-01

We are motivated by the analogue of Turán's theorem in hypercube $Q_n$: How many edges can a $Q_d$‐free subgraph $Q_n$ have? study this question through its Ramsey‐type variant and obtain asymptotic results. show that for every odd d it is possible to color with $\frac{(d+1)^2}{4}$ colors such each subcube $Q_d$ polychromatic, is, contains an edge color. The number tight up constant factor, as turns out similar coloring ${d+1\choose 2} +1$ not possible. corresponding vertices also...

10.1137/060649422 article EN SIAM Journal on Discrete Mathematics 2007-01-01

Abstract We study biased Maker/Breaker games on the edges of complete graph, as introduced by Chvátal and Erdős. show that Maker, occupying one edge in each his turns, can build a spanning tree, even if Breaker occupies b ≤ (1 − o (1)) · $ {n \over \ln n} turn. This improves result Beck, is asymptotically best possible witnessed Breaker‐strategy also give strategy for Maker to occupy graph with minimum degree c (where = ( n ) slowly growing function while playing against who takes earlier...

10.1002/rsa.20279 article EN Random Structures and Algorithms 2009-07-27

10.1016/s0095-8956(03)00031-5 article EN Journal of Combinatorial Theory Series B 2003-04-05

10.1016/j.jcta.2006.10.001 article EN publisher-specific-oa Journal of Combinatorial Theory Series A 2006-11-14

Let m and b be positive integers, let F a hypergraph. In an $(m,b)$ Maker-Breaker game two players, called Maker Breaker, take turns selecting previously unclaimed vertices of F. selects per move, Breaker move. The ends when every vertex has been claimed by one the players. wins if he claims all some hyperedge F; otherwise wins. An Avoider-Enforcer is played in similar way. only difference determination winner: Avoider loses Enforcer loses. this paper we consider versions planarity game,...

10.1137/060654414 article EN SIAM Journal on Discrete Mathematics 2008-01-01

Abstract We introduce and study Maker/Breaker‐type positional games on random graphs. Our main concern is to determine the threshold probability p ℱ for existence of Maker's strategy claim a member in unbiased game played edges graph G ( n, ), various target families winning sets. More generally, each above this we smallest bias b such that Maker wins (1 : ) biased game. investigate these functions number basic games, like connectivity game, perfect matching clique Hamiltonian cycle © 2005...

10.1002/rsa.20059 article EN Random Structures and Algorithms 2005-01-01

We prove that in the biased $(1:b)$ Hamiltonicity and $k$-connectivity Maker-Breaker games ($k>0$ is a constant), played on edges of complete graph $K_n$, Maker has winning strategy for $b\le(\log 2-o(1))n/\log n$. Also, Avoider-Enforcer game $E(K_n)$, Enforcer can force Avoider to create Hamilton cycle when $b\le (1-o(1))n/\log These results are proved using new approach, relying existence hypergraphs with few large covering number.

10.37236/794 article EN The Electronic Journal of Combinatorics 2008-05-05

SummaryThe commencement and cessation of flight activity in Megachile rotundata showed a significant negative correlation with light intensity temperature, indicating that has dual threshold these factors. Foraging females was positively correlated temperature combined, but not independently temperature. Comparing lower range (16·5–21°C) higher one (21–25°C), the mean flower-visiting rate 30 on Lotus corniculatus 4·8 10·3 per minute, respectively, number flowers visited trip 7·5 17·8...

10.1080/00218839.1972.11099717 article EN Journal of Apicultural Research 1972-01-01

We construct unsatisfiable k-CNF formulas where every clause has k distinct literals and variable appears in at most (2/e +o(1)) 2k/k clauses. The lopsided Local Lemma shows that our result is asymptotically best possible: formula 2k+1/e(k+1) − 1 clauses satisfiable. determination of this extremal function particularly important as it represents the value k-SAT problem exhibits its complexity hardness jump: from having instance being a YES-instance becomes NP-hard just by allowing each to...

10.5555/2133036.2133088 article EN 2011-01-23

We study the conflict-free chromatic number χ CF of graphs from extremal and probabilistic points view. resolve a question Pach Tardos about maximum an n -vertex graph can have. Our construction is randomized. In relation to this we evolution Erdős–Rényi random G ( n,p ) give asymptotics for p = ω(1/ ). also show that ≥ 1/2 differs domination by at most 3.

10.1017/s0963548313000540 article EN Combinatorics Probability Computing 2013-11-29

SummarySister queen honeybees (Apis mellifera), 59 instrumentally inseminated (IIS) and naturally mated (NM), were produced in Baton Rouge, Louisiana, put into field colonies at 3 locations Alberta, Canada 1 location USA. Survival of the IIS queens was lower than that NM queens; 37 50 survived from August 1981 to May 1982, 18 34 until 1982 (P<0·01). At all 4 locations, with had 21–73% more capped brood (February Louisiana) did Probably because this difference production, honey. Over a...

10.1080/00218839.1984.11100606 article EN Journal of Apicultural Research 1984-01-01

Strawberry varieties were studied in 3 different growing areas of soil- and ecological properties Hungary. We have measured the optical spectra leaves together with their nutrient content performed sensory examinations on deep frozen melted fruit. The 6 Elsanta, Marianna, Spadeka, Symphony, Camarosa, Raurica. sites Újfehértó, Pölöske, Kecskemet. Colour was characterised by lightness dominant wavelength. Under non-optimal soil conditions could be distinguished colour — became lighter more...

10.31421/ijhs/13/2/713 article EN cc-by International Journal of Horticultural Science 2007-05-15
Coming Soon ...